Drawing graphs on two and three lines

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

Volumn 2528, Issue , 2002, Pages 31-41

  Cornelsen, Sabine ^a   Schank, Thomas ^a   Wagner, Dorothea ^a  

^a UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BIPARTITE GRAPHS; LINEAR TIME; LINEAR-TIME ALGORITHMS; PARALLEL LINE; PLANAR DRAWING;

CLUSTERING ALGORITHMS; ALGORITHMS;

DRAWING (GRAPHICS);

EID: 84867469770     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-36151-0_4     Document Type: Article

References (8)

1. T. C. Biedl. Drawing planar partitions I: LL-drawings and LH-drawings. In Proceedings of the 14th Annual ACM Symposium on Computational Geometry (SCG '98), pages 287-296, 1998.
2. T. C. Biedl, M. Kaufmann, and P. Mutzel. Drawing planar partitions II: HH-drawings. In J. Hromkovic, editor, Graph Theoretic Cocepts in Computer Science, 24th International Workshop, (WG '98), volume 1517 of Lecture Notes in Computer Science, pages 124-136. Springer, 1998.
3. P. Eades, B. D. McKay, and N. C. Wormald. On an edge crossing problem. In Proceedings of the 9th Australian Computer Science Conference (ACSC 9), pages 327-334, 1986.
4. S. Felsner, G. Liotta, and S. K. Wismath. Straight-line drawings on restricted integer grids in two and three dimensions. In M. Jünger and P. Mutzel, editors, Proceedings of the 9th International Symposium on Graph Drawing (GD 2001), volume 2265 of Lecture Notes in Computer Science, pages 328-342. Springer, 2002.
5. U. Fößmeier and M. Kaufmann. Nice drawings for planar bipartite graphs. In G. Bongiovanni, D. P. Bovet, and G. Di Battista, editors, Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC '97), volume 1203 of Lecture Notes in Computer Science, pages 122-134. Springer, 1997.
6. F. Harary and A. Schwenk. A new crossing number for bipartite graphs. Utilitas Mathematica, 1:203-209, 1972.
7. M. Jünger, S. Leipert, and P. Mutzel. Level planarity testing in linear time. In S. H. Whitesides, editor, Proceedings of the 6th International Symposium on Graph Drawing (GD '98), volume 1547 of Lecture Notes in Computer Science, pages 224-237. Springer, 1998.
8. T. Schank. Algorithmen zur Visualisierung planarer partitionierter Graphen. Master's thesis, Universität Konstanz, 2001. http://www.inf.uni- konstanz.de/algo/lehre/theses/.