Improved approximations of crossings in graph drawings

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 296-305

  Even, Guy ^a   Guha, Sudipto ^b   Schieber, Baruch ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b Stanford University   (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED DEGREE GRAPHS; EMBEDDING PROBLEMS; GRAPH DRAWING; IMPROVE-A; LAYOUT AREA; MINIMIZING THE NUMBER OF; VLSI LAYOUT;

ASPECT RATIO; INFORMATION DISSEMINATION; OPTIMIZATION;

COMPUTATION THEORY;

EID: 84878913592     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.335340     Document Type: Conference Paper

References (12)

1. S.N. Bhatt and F.T. Leighton, "A framework for solving VLSI graph layout problems", J. of Computer and System Sciences, 28:300-343, 1984.
2. G. Even, J. Naor, S. Rao and B. Schieber, "Fast approximate graph partitioning algorithms", SIAM J. on Computing, 28(6):2187-2214, 1999. (Pubitemid 30530997)
3. S. Guha, "Nested dissection and approximation algorithms", Manuscript.
4. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, California, 1979.
5. M.R. Garey and D.S. Johnson, "Crossing number is NP-complete", SIAM J. Algebraic Discrete Methods, 4(3):312-316, 1983.
6. C.E. Leiserson. "Area-efficient graph layouts (for VLSI)". In 21st Annual Symposium on Foundations of Computer Science, pp. 270-281, Syracuse, New York, 1980.
7. F.T. Leighton, Complexity Issues in VLSI, MIT Press, 1983.
8. F.T. Leighton and S. Rao, "Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms", J. of the ACM, Upcoming Articles, http://www.acm.org/jacm/Upcoming.html
9. R.J. Lipton and R.E. Tarjan, "A separator theorem for planar graphs", SIAM J. on Applied Mathematics, 36(2):177-189, 1979.
10. F. Shahrokhi, O. Sýkora, L.A. Székely, and I. Vrťo, "Crossing Numbers: bounds and applications", Intuitive Geometry, Bolyai Society Mathematical Studies 6, Budapest, pp. 179-206, 1997.
11. J.D. Ullman, Computational Aspects of VLSI, Computer Science Press, 1984.
12. L.G. Valiant, "Universality considerations in VLSI circuits", IEEE Transactions on Computers, C-30(2):135-140, 1981.