共 50 条
- [2] Heuristic algorithms for the triangulation of graphs [J]. ADVANCES IN INTELLIGENT COMPUTING - IPMU '94, 1995, 945 : 98 - 107
- [4] A Hybrid Heuristic for Solving the Triangulation Problem [J]. BRAIN-BROAD RESEARCH IN ARTIFICIAL INTELLIGENCE AND NEUROSCIENCE, 2010, 1 (02): : 5 - 8
- [5] A NEW HEURISTIC FOR MINIMUM WEIGHT TRIANGULATION [J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1987, 8 (04): : 646 - 658
- [6] The minimum degree heuristic and the minimal triangulation process [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2003, 2880 : 58 - 70
- [9] A general and fast triangulation algorithm [J]. Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics, 2001, 13 (09): : 769 - 773
- [10] A DELAUNAY TRIANGULATION-BASED HEURISTIC FOR THE EUCLIDEAN STEINER PROBLEM [J]. NETWORKS, 1994, 24 (04) : 215 - 224