The realization problem for Euclidean minimum spanning trees is NP-hard-Reference-Cited by-同舟云学术

The realization problem for Euclidean minimum spanning trees is NP-hard

Published:1996-07 Issue:1 Volume:16 Page:60-82
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Eades P.,Whitesides S.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF02086608.pdf

Reference24 articles.

1. G. Di Battista, R. Tamassia, and I. G. Tollis. Area requirement and symmetry display in drawing graphs.Proc. ACM Symp. on Computational Geometry, 1989, pp. 51–60.

2. B. Becker and H. G. Osthof. Layout with wires of balanced length.Information and Computation, 73:45–58, 1987.

3. S. Bhatt and S. Cosmodakis. The complexity of minimizing wire lengths in VLSI layouts.Information Processing Letters, 25:263–267, 1987.

4. P. Bose, W. Lenhart, and G. Liotta. Characterizing proximity trees. InGraph Drawing 93, 1993.

5. F. J. Brandenburg. Nice drawings of graphs and trees are computationally hard. Technical Report MIP-8820, Fakultat fur Mathematik und Informatik, University Passau, 1988.

Cited by 31 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Drawing a rooted tree as a rooted y−monotone minimum spanning tree;Information Processing Letters;2021-02

2. Shape-Based Quality Metrics for Large Graph Visualization;Lecture Notes in Computer Science;2015

3. Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees;Lecture Notes in Computer Science;2015

4. On the area requirements of Euclidean minimum spanning trees;Computational Geometry;2014-02

5. Increasing-Chord Graphs On Point Sets;Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications;2014