Nice drawings for planar bipartite graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1203, Issue , 1997, Pages 122-134

  Fößmeier, Ulrich ^a   Kaufmann, Michael ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DRAWING (GRAPHICS); GRAPH THEORY;

BIPARTITE GRAPHS; BIPARTITENESS; CHARACTERISTIC PROPERTIES; GRAPH DRAWING ALGORITHMS; INPUT GRAPHS; PLANAR DRAWING;

ALGORITHMS;

EID: 84957697664     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62592-5_66     Document Type: Conference Paper

References (13)

1. Di Battista G., P. Eades, R. Tamassia and I.G. Tollis, 'Algorithms for Drawing Graphs: an Annotated Bibliography', Computational Geometry: Theory & Applications, (1994), pp. 235-282.
2. Di Battista G., W.-P. Liu and I. Rival, 'Bipartite graphs, upward drawings, and planarity', Information Processing Letters, 36 (1990), pp. 317-322.
3. Eades P., 'A heuristic for graph drawing', Congr. Numerant., (1984), pp. 149-160.
4. Eades P., B.D. McKay and N. Wormald, On an edge crossing problem', Proc. Australian Computer Science Conf., Austr. Nat. Univ. (1986), pp. 327-334.
5. Eades P. and N. Wormald, 'The Median Heuristic for Drawing 2-layered Networks', Technical Report 69, Dept, of Comp. Science, Univ. of Queensland, 1986.
6. Fraysseix, H. de, J. Pach and R. Pollack, 'How to draw a planar graph on a grid', Combinatorica 10 (1990), pp. 41-51.
7. Garey, M.R. and D.S. Johnson, 'Crossing Number is NP-complete', SIAM J. Algebraic and Discrete Methods, 4(3) (1983), pp. 312-316.
8. Garey, M.R., D.S. Johnson and R.E. Tarjan, 'The Planar Hamiltonian Circuit Problem is NP-complete', SIAM J. Comput. 5 (1976), pp. 704-714.
9. Jünger M. and P. Mutzel, 'Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization', Proc. Graph Drawing, (1995), LNCS 1027, pp. 337-349.
10. Mitchell S.L. 'Linear algorithms to recognize outerplanar and maximal outplanar graphs', Information Processing Letters 9 (1979), pp. 229-232.
11. Kamada T. and S. Kawai, 'An algorithm for drawing general undirected graphs', Information Processing Letters, 31 (1989), pp. 70-15.
12. Sugiyama K., S. Tagawa and M. Toda, 'Methods for visual understanding of hierarchical Systems', IEEE Trans, on Systems, Man and Cybern., 11 (1981), pp.109-125.
13. Tomii, N., Y. Kambayashi, and Y. Shuzo, On Planarization Algorithms of 2-Level Graphs', Papers of tech. group on elect, comp., IECEJ, EC77-38 (1977), pp. 1-12.