Confluent layered drawings

Lecture Notes in Computer Science

Volumn 3383, Issue , 2004, Pages 184-194

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

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; HEURISTIC METHODS; TREES (MATHEMATICS); HEURISTIC ALGORITHMS;

BIPARTITE SUBGRAPHS; CONFLUENT LAYERED DRAWINGS; EDGE COLORING PROBLEMS; SUGIYAMA STYLE DRAWINGS;

DRAWING (GRAPHICS);

BIPARTITE SUBGRAPHS; COLORING ALGORITHMS; CONFLUENT LAYERED DRAWINGS; EDGE COLORING PROBLEMS; EDGE CROSSING; LAYERED GRAPHS; SUGIYAMA STYLE DRAWINGS; TREE-LIKE STRUCTURES;

EID: 24144471070     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

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), volume 2528 of Lecture Notes Comput. Sci., pages 130-141. Springer-Verlag, 2002.
2. Brélaz. New methods to color the vertices of a graph. Communications of the 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 Publishing Co, 1988.
4. M. J. Carpano. Automatic display of hierarchized graphs for computer aided decision analysis. IEEE Trans. Syst. Man Cybern., SMC-10(11):705-715, 1980.
5. M. Dickerson, D. Eppstein, M. T. Goodrich, and J. Y. Meng. Confluent drawing: Visualizing nonplanar diagrams in a planar way. In G. Liotta, editor, Graph Drawing (Proc. GD '03), volume 2912 of Lecture Notes Comput. Sci., pages 1-12. Springer-Verlag, 2003.
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), volume 2528 of Lecture Notes Comput. Sci., pages 285-294. Springer-Verlag, 2002.
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), volume 2528 of Lecture Notes Comput. Sci., pages 276-284. Springer-Verlag, 2002.
11. E. R. Gansner, E. Koutsofios, S. C. North, and K. P. Vo. A technique for drawing directed graphs. IEEE Trans. Softw. Eng., 19:214-230, 1993.
12. E. R. Gansner, S. C. North, and K. P. Vo. DAG - A program that draws directed graphs. Softw. - 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. W. H. Freeman, New York, NY, 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. Journal of Research of National Bureau of Standard, 84:489-506, 1979.
19. E. B. Messinger. Automatic layout of large directed graphs. Technical Report 88-07-08, Department of Computer Science, University of Washington, 1988.
20. 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. Syst. Man Cybern., SMC-21(1):1-12, 1991.
21. F. J. Newbery. Edge concentration: A method for clustering directed graphs. In Proc. 2nd Internat. Workshop on Software Configuration Management, pages 76-85, 1989.
22. F. Newbery Paulisch and W. F. Tichy. EDGE: An extendible graph editor. Softw. - Pract. Exp., 20(S1):63-88, 1990.
23. also as Technical Report 8/88, Fakultat fur Informatik, Univ. of Karlsruhe, 1988.
24. 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), volume 2528 of Lecture Notes Comput. Sci., pages 312-319. Springer-Verlag, 2002.
25. H. Purchase. Which aesthetic has the greatest effect on human understanding? In G. Di Battista, editor, Graph Drawing (Proc. GD '97), volume 1353 of Lecture Notes Comput. Sci., pages 248-261. Springer-Verlag, 1997.
26. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical systems. IEEE Trans. Syst. Man Cybern., SMC-11(2):109-125, 1981.
27. V. Waddle and A. Malhotra. An E log E line crossing algorithm for levelled graphs. In J. Kratochvfl, editor, Graph Drawing (Proc. GD '99), volume 1731 of Lecture Notes Comput. Sci., pages 59-71. Springer-Verlag, 1999.