Convex drawing for c-planar biconnected clustered graphs

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

Volumn 2912, Issue , 2004, Pages 369-380

  Nagamochi, Hiroshi ^a   Kuroya, Katsutoshi ^b  

^a TOYOHASHI UNIVERSITY OF TECHNOLOGY   (Japan)

^b HITACHI LTD   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS);

CLUSTERED GRAPH; CONVEX DRAWINGS; CONVEX POLYGON; STRAIGHT-LINE SEGMENTS; SUBGRAPHS; TREE REPRESENTATION;

TREES (MATHEMATICS);

EID: 33244478354     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24595-7_34     Document Type: Article

References (13)

1. G. D. Battista, P. Eades, R. Tamassia, and I. G. Tollis, Graph drawing, PrenticeHall, 1999.
2. V. Batagelj, D. Kerzic and T. Pisanski, Automatic clustering of languages, Computational Linguistics, 18(3) 339-352, 1992.
3. E. Dahlhaus, Linear time algorithm to recognize clustered planar graphs and its parallelization (extended abstract), Latin America symposium on theoretical informatics (LATIN'98), Lecture Notes in Computer Science, 1380, 239-248, 1998.
4. C. A. Duncan, M. T. Goodrich, and S. G. Kobourov, Planarity-preserving clustering and embedding for large planar graphs, Graph Drawing (GD'99), Lecture Notes in Computer Science, 1731, 186-196, 1999.
5. P. Eades, Q.-W. Feng and H. Nagamochi, Drawing clustered graphs on an orthogonal grid, Journal of Graph Algorithms and Application, 3(4), 3-29, 1999.
6. P. Eades and Q.-W. Feng, Drawing clustered graphs on orthogonal grid, Graph Drawing (GD'97), Lecture Notes in Computer Science, 1353, 146-157, 1997.
7. P. Eades, Q.-W. Feng, X. Lin, and H. Nagamochi, Straight-line drawing algorithms for hierarchical graphs and clustered graphs, Technical Report Newcastle University (submitted to ajournai), 1999.
8. Q.-W. Feng, R.-F. Cohen and P. Eades, Planarity for clustered graphs, Algorithms (ESA'95), Lecture Notes in Computer Science, 979, 213-226, 1995.
9. E. Godehardt, Graphs as Structural Models, Advances in System Analysis 4, Vieweg, 1998.
10. C. Gutwenger, M. Jünger, S. Leipert, P. Mutzel, M. Percan and R. Weiskircher, Advances in c-planarity testing of clustered graphs (extended abstract), Graph Drawing (GD 2002), Lecture Notes in Computer Science, 2528, 220-235, 2002.
11. D. Harel and R. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM J. Computing, 13, 338-355, 1984.
12. M. Kaufmann and D. Wagner, Drawing graphs, Lecture Notes in Computer Science, 2025, Springer, 2001.
13. T. Nishizeki and N. Chiba, Planar Graphs: Theory and Algorithms, North-Holland Mathematics Studies 140/32, 1988.