Drawing graphs on two and three lines

Journal of Graph Algorithms and Applications

Volumn 8, Issue 2, 2004, Pages 161-177

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

^a UNIVERSITY OF L'AQUILA   (Italy)

^b UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS);

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

CLUSTERING ALGORITHMS;

EID: 24344452023     PISSN: 15261719     EISSN: 15261719     Source Type: Journal    
DOI: 10.7155/jgaa.00087     Document Type: Conference Paper

References (9)

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 Concepts in Computer Science, 24th International Workshop, (WG'98), volume 1517 of Lecture Notes in Computer Science, pages 124-136. Springer, 1998.
3. V. Dujmović, M. Fellows, M. Hallett, M. Kitching, G. Liotta, C. McCartin, K. Nishimura, P. Ragde, F. Rosamond, M. Suderman, S. H. Whitesides, and D. Wood. On the parametrized compexity of layered graph drawing. In F. M. auf der Heide, editor, Proceedings of the 9th European Symposium on Algorithms (ESA'01), volume 2161 of Lecture Notes in Computer Science, pages 488-499. Springer, 2001.
4. 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.
5. 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.
6. 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.
7. F. Harary and A. Schwenk. A new crossing number for bipartite graphs. Utilitas Mathematica, 1:203-209, 1972.
8. 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.
9. T. Schank. Algorithmen zur Visualisierung planarer partitionierter Graphen. Master's thesis, Universität Konstanz, 2001. (wissenschaftliche Arbeit im Staatsexamensstudium) http://www.inf.uni-konstanz.de/algo/lehre/ theses/.