Algorithms for multi-level graph planarity testing and layout

Theoretical Computer Science

Volumn 320, Issue 2-3, 2004, Pages 331-344

  Healy, Patrick ^a   Kuusik, Ago ^a  

^a UNIVERSITY OF LIMERICK   (Ireland)

Author keywords

Level graph layout; Level graphs; Level planarity testing

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING;

LEVEL GRAPH LAYOUT; LEVEL GRAPHS; LEVEL PLANARITY TESTING;

GRAPH THEORY;

EID: 2442687127     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.02.033     Document Type: Article

References (11)

1. Di Battista G., Eades P., Tamassia R., Tollis I.G. Graph Drawing, Algorithms for the Visualization of Graphs. 1999;Prentice-Hall, Englewood Cliffs, NJ.
2. V. Dujmović, M. Fellows, M. Hallett, M. Kitching, G. Liotta, C. McCartin, N. Nishimura, P. Ragde, F. Rosemand, M. Suderman, S. Whitesides, D.R. Wood, On the parameterized complexity of layered graph drawing, in: P. Mutzel, M. Jünger, S. Leipert (Eds.), Graph Drawing, 9th Intl. Symp. (GD 2001), Lecture Notes in Computer Science, Vol. 2265, Springer, Berlin, 2001, pp. 1-15.
3. Eades P., Kelly D. Heuristics for drawing 2-layered networks. Ars Combin. 21-A:1986;89-98.
4. Eades P., Sugiyama K. How to draw a directed graph. J. Inform. Process. 13(4):1990;424-437.
5. Eades P., Wormald N.C. Edge crossings in drawings of bipartite graphs. Algorithmica. 11:1994;379-403.
6. P. Healy, A. Kuusik, S. Leipert, Characterization of level non-planar graphs by minimal patterns, in: D.-Z. Du, P. Eades, V. Estivill-Castro, X. Lin, A. Sharma (Eds.), Computing and Combinatorics: Proc. Sixth Internat. Conf., COCOON 2000, Lecture Notes in Computer Science, Vol. 1858, Springer, Berlin, 2000, pp. 74-84.
7. M. Jünger, E.K. Lee, P. Mutzel, T. Odenthal, A polyhedral approach to multi-layer crossing minimization problem, in: Graph Drawing, Fifth Internat. Symp., GD '97, Rome, Italy, September 1997, Lecture Notes in Computer Science, Vol. 1353, Springer, Berlin, 1997, pp. 13-24.
8. M. Jünger, S. Leipert, P. Mutzel, Level planarity testing in linear time, Technical Report 98.321, Institut für Informatik, Universität zu Köln, 1998.
9. Jünger M., Mutzel P. Exact and heuristic algorithms for 2-layer crossing minimization. Brandenburg F.J. Graph Drawing, Symp. on Graph Drawing, GD '95, Passau, Germany, September 20-22, 1995. Lecture Notes in Computer Science. Vol. 1027:1995;337-348 Springer, Berlin.
10. Sugiyama K., Tagawa S., Toda M. Methods for visual understanding of hierarchical system structures. IEEE Trans. Systems Man and Cybernet. 11(2):1981;109-125.
11. J. Utech, J. Branke, H. Schmeck, P. Eades, An evolutionary algorithm for drawing directed graphs, in: Proc. 1998 Internat. Conf. on Imaging Science, Systems, and Technology (CISST'98), 1998, pp. 154-160.