论文信息 - Graph graphics: Theory and practice

Graph graphics: Theory and practice

Abstract Many graph drawing problems are NP-complete. Most of the problems described in this expository survey have constraints that relate to either minimizing the number of crossings or minimizing some function of the edge lengths. Nevertheless, these problems are sufficiently common in some areas that polynomial-time algorithms for special cases and heuristics for more general cases have been developed. A graph-theoretic characterization of some of these problems is given, followed by a discussion of their complexity. Finally, several algorithms and heuristics for graph layout [some with applications to very large scale integration (VLSI)] will be discussed.

C. Esposito | C. Esposito

[1] Frank Harary,et al. Graph Theory , 2016 .

[2] Robert E. Tarjan,et al. Efficient Planarity Testing , 1974, JACM.

[3] Robert E. Tarjan,et al. Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[4] Norishige Chiba,et al. A Linear Algorithm for Embedding Planar Graphs Using PQ-Trees , 1985, J. Comput. Syst. Sci..

[5] James B. Orlin,et al. NP-Completeness for Minimizing Maximum Edge Length in Grid Embeddings , 1985, J. Algorithms.

[6] W. T. Tutte. How to Draw a Graph , 1963 .

[7] Kellogg S. Booth,et al. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[8] Frank Thomson Leighton,et al. A Framework for Solving VLSI Graph Layout Problems , 1983, J. Comput. Syst. Sci..

[9] Jeffrey D Ullma. Computational Aspects of VLSI , 1984 .

[10] David S. Johnson,et al. Crossing Number is NP-Complete , 1983 .

[11] Robert E. Tarjan,et al. Computing an st -Numbering , 1976, Theor. Comput. Sci..

[12] Robert William Shirey,et al. Implementation and analysis of efficient graph planarity testing algorithms , 1969 .

[13] Peter Eades,et al. A Heuristic for Graph Drawing , 1984 .