Drawing planar partitions II: HH-drawings

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

Volumn 1517, Issue , 1998, Pages 124-136

  Biedl, Therese ^a   Kaufmann, Michael ^b   Mutzel, Petra ^c  

^a MCGILL UNIVERSITY   (Canada)

^b UNIVERSITY OF TÜBINGEN   (Germany)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS;

EDGE CROSSING; LINEAR-TIME ALGORITHMS; LOWER BOUNDS; PLANAR DRAWING; PLANAR GRAPH; VERTEX PARTITIONS;

GRAPH THEORY;

EID: 84947076077     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10692760_11     Document Type: Conference Paper

References (20)

1. T. Biedl. Drawing planar partitions I: LL-drawings and LH-drawings. In 14th Annu. ACM Symp. Computational Geometry, pages 287–296, 1998.
2. T. Biedl, M. Kaufmann, and P. Mutzel. Drawing planar partitions II: HH-drawings. Technical Report RRR 12-98, RUTCOR, Rutgers University, 1998.
3. T. Biedl. Drawing planar partitions III: Two constrained embeddings. Technical Report RRR 13-98, RUTCOR, Rutgers University, 1998.
4. M. Chrobak and G. Kant. Convex grid drawings of 3-connected planar graphs. Internat. J. Comput. Geom. Appl., 7(3):211–223, 1997.
5. M. Chrobak and S. Nakano. Minimum-width grid drawings of plane graphs. In R. Tamassia and I. Tollis, editors, DIMACS International Workshop, Graph Drawing 94, volume 894 of Lecture Notes in Computer Science, pages 104–110. Springer- Verlag, 1995.
6. G. Di Battista, P. Eades, R. Tamassia, and I. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comp. Geometry: Theory and Applications, 4(5):235–282, 1994.
7. G. Di Battista, R. Tamassia, and I. Tollis. Area requirement and symmetry display of planar upward drawings. Discrete Computational Geometry, 7(4):381–401, 1992.
8. P. Eades, B. D. McKay, and N. Wormald. On an edge crossing problem. In ACSC 9, 9th Australian Computer Science Conference, pages 327–334, 1986.
9. S. Even. Graph Algorithms. Computer Science Press, 1979.
10. U. Foßmeier and M. Kaufmann. Nice drawings for planar bipartite graphs. In 3rd Italian Conference on Algorithms and Complexity, CIAC ’97, volume 1203 of Lecture Notes in Computer Science, pages 122–134. Springer-Verlag, 1997.
11. H. de Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10:41–51, 1990.
12. C. Gutwenger and P Mutzel. Grid embedding of biconnected planar graphs. Extended Abstract, Max-Planck-Institut fur Informatik, Saarbr¨ucken, Germany, 1998.
13. J. Halton. On the thickness of graphs of given degree. Information Sciences, 54:219–238, 1991.
14. J. Harary and A. Schwenk. A new crossing number for bipartite graphs. Utilitas Mathematica, 1:203–209, 1972.
15. G. Kant. Drawing planar graphs using the canonical ordering. Algorithmica, 16:4–32, 1996.
16. J. Kratochvil and M. Kˇrivanek. Satisfiability of co-nested formulas. Acta Informatica, 30(4):397–403, 1993.
17. S. North, editor. Symposium on Graph Drawing 96, volume 1190 of Lecture Notes in Computer Science. Springer-Verlag, 1997. For information on the contest, see http://www.research.att.com/conf/gd96/contest.html.
18. J. Pach, F. Shahrokhi, and M. Szegedy. Applications of the crossing number. Algorithmica, 16:111–117, 1996.
19. H. Purchase. Which aesthetic has the greatest effect on human understanding? In G. Di Battista, editor, Graph Drawing ’97, volume 1353 of Lecture Notes in Computer Science, pages 248–261. Springer-Verlag, 1998.
20. R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Computing, 16(3):421–444, 1987.