Confluent layered drawings

Algorithmica (New York)

Volumn 47, Issue 4, 2007, Pages 439-452

  Eppstein, David ^a   Goodrich, Michael T ^a   Meng, Jeremy Yu ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Confluent drawing; Cross reduction; Graph drawing; Layered drawing

Indexed keywords

BIPARTITE SUBGRAPHS; CONFLUENT LAYERED DRAWINGS; CROSS REDUCTION; EDGE CROSSINGS;

HEURISTIC ALGORITHMS; PROBLEM SOLVING; TREES (MATHEMATICS);

DRAWING (GRAPHICS);

EID: 33947578092     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-006-0159-8     Document Type: Conference Paper

References (29)

1. W. Barth, M. Jünger, and P. Mutzel. Simple and efficient bilayer crossing counting. In M. Goodrich and S. Kobourov, editors, Graph Drawing (Proc. GD '02), pages 130-141. Volume 2528 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2003.
2. D. Brélaz. New methods to color the vertices of a graph. Comm. ACM, 22(4):251-256, 1979.
3. G. Campers, O. Henkes, and J. P. Leclerq. Graph coloring heuristics: a survey, some new propositions and computational experiences on random and "Leighton's" graphs. In G. K. Rand, editor, Operational Research '87 (Buenos Aires, 1987), pages 917-932. North-Holland, Amsterdam, 1988.
4. M. J. Carpano. Automatic display of hierarchized graphs for computer aided decision analysis. IEEE Trans. Systems Man Cybernet., SMC-10(11):705-715, 1980.
5. M. Dickerson, D. Eppstein, M. T. Goodrich, and J. Y. Meng. Confluent drawings: visualizing nonplanar diagrams in a planar way. In G. Liotta, editor, Graph Drawing (Proc. GD '03), pages 1-12. Volume 2912 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2004.
6. P. Eades and K. Sugiyama. How to draw a directed graph. J. Inform. Process., 13:424-437, 1991.
7. J. Ellson, E. Gansner, E. Koutsofios, and S. North. Graphviz. URL: http://www.research.att.com/sw/tools/graphviz.
8. T. Eschbach, W. Günther, R. Drechsler, and B. Becker. Crossing reduction by windows optimization. In M. Goodrich and S. Kobourov, editors, Graph Drawing (Proc. GD '02), pages 285-294. Volume 2528 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2003.
9. P. C. Fishburn and P. L. Hammer. Bipartite dimensions and bipartite degree of graphs. Discrete Math., 160:127-148, 1996.
10. M. Forster. Applying crossing reduction strategies to layered compound graphs. In M. Goodrich and S. Kobourov, editors, Graph Drawing (Proc. GD '02), pages 276-284. Volume 2528 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2003.
11. E. R. Gansner, E. Koutsofios, S. C. North, and K. P. Vo. A technique for drawing directed graphs. IEEE Trans. Software Engrg., 19:214-230, 1993.
12. E. R. Gansner, S. C. North, and K. P. Vo. DAG - A program that draws directed graphs. Software Pract. Exp., 18(11):1047-1062, 1988.
13. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979.
14. M. R. Garey and D. S. Johnson. Crossing number is NP-complete. SIAM J. Algebraic Discrete Methods, 4(3):312-316, 1983.
15. D. J. Gschwind and T. P. Murtagh. A recursive algorithm for drawing hierarchical directed graphs. Technical Report CS-89-02, Department of Computer Science, Williams College, 1989.
16. M. Jünger and P. Mutzel. 2-Layer straightline crossing minimization: performance of exact and heuristic algorithms. J. Graph Algorithms Appl., 1(1):1-25, 1997.
17. E. Koutsofios and S. North. Drawing graphs with dot. Technical report, AT&T Bell Laboratories, Murray Hill, NJ., 1995. Available from http://www.research.bell-labs.com/dist/drawdag.
18. F. T. Leighton. A graph coloring algorithm for large scheduling problems. J. Res. Nat. Bur. Standard, 84:489-506, 1979.
19. X. Lin. On the computational complexity of edge concentration. Discrete Appl. Math., 101:197-205, 2000.
20. E. B. Messinger. Automatic layout of large directed graphs. Technical Report 88-07-08, Department of Computer Science, University of Washington, 1988.
21. E. B. Messinger, L. A. Rowe, and R. H. Henry. A divide-and-conquer algorithm for the automatic layout of large directed graphs. IEEE Trans. Systems Man Cybernet., SMC-21(1):1-12, 1991.
22. F. J. Newbery. Edge concentration: a method for clustering directed graphs. In Proc. 2nd Internat. Workshop on Software. Configuration Management, pages 76-85, 1989.
23. F. Newbery Paulisch and W. F. Tichy. EDGE: an extendable graph editor. Software. Pract. Exp., 20(S1):63-88, 1990.
24. Also as Technical Report 8/88, Fakultat fur Informatik, Univ. of Karlsruhe, 1988.
25. M. Newton, O. Sýkora, and I. Vrt'o. Two new heuristics for two-sided bipartite graph drawing. In M. Goodrich and S. Kobourov, editors, Graph Drawing (Proc. GD '02), pages 312-319. Volume 2528 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2003.
26. H. Purchase. Which aesthetic has the greatest effect on human understanding? In G. Di Battista, editor, Graph Drawing (Proc. GD '97), pages 248-261. Volume 1353 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1997.
27. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical systems. IEEE Trans. Systems Man Cybernet., SMC-11(2):109-125, 1981.
28. V. Waddle and A. Malhotra. An E log E line crossing algorithm for levelled graphs. In J. Kratochvíl, editor, Graph Drawing (Proc. GD '99), pages 59-71. Volume 1731 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1999.
29. H. P. Williams. Model Building in Mathematical Programming, third edition. Wiley, New York, 1990.