Really straight graph drawings

Lecture Notes in Computer Science

Volumn 3383, Issue , 2004, Pages 122-132

  Dujmović, Vida ^a,b   Suderman, Matthew ^a   Wood, David R ^b,c  

^a MCGILL UNIVERSITY   (Canada)

^b CARLETON UNIVERSITY   (Canada)

^c CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; GRAPH THEORY; TREES (MATHEMATICS); DRAWING (GRAPHICS); GRAPHIC METHODS;

BOUNDED TREEWIDTH; NON-PLANAR GRAPHS; OUTERPLANAR GRAPHS; STRAIGHT-LINE DRAWINGS;

DRAWING (GRAPHICS); GRAPH THEORY;

BOUNDED DEGREE; BOUNDED TREEWIDTH; GRAPH DRAWING; NON-PLANAR GRAPHS; OPTIMAL RESULTS; OUTERPLANAR GRAPH; PLANE GRAPHS; STRAIGHT-LINE DRAWINGS;

EID: 24144455989     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. HANS L. BODLAENDER. A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci., 209(1-2):1-45, 1998.
2. GUOLI DING AND BOGDAN OPOROWSKI. Some results on tree decomposition of graphs. J. Graph Theory, 20(4):481-499, 1995.
3. VIDA DUJMOVIĆ, MATTHEW SUDERMAN, AND DAVID R. WOOD. Really straight graph drawings. arXiv.org:cs.DM/0405112, 2004.
4. VIDA DUJMOVIĆ AND DAVID R. WOOD. On linear layouts of graphs. Discrete Math. Theor. Comput. Sci., 6(2):339-358, 2004.
5. CHRISTIAN A. DUNCAN, DAVID EPPSTEIN, AND STEPHEN G. KOBOUROV. The geometric thickness of low degree graphs. In Proc. 20th ACM Symp. on Computational Geometry (SoCG '04), pp. 340-346. ACM Press, 2004.
6. DAVID EPPSTEIN. Dilation-free planar graphs. http://www.ics.uci.edu/ ~eppstein/junkyard/dilation-free/, 1997.
7. DAVID EPPSTEIN. Separating thickness from geometric thickness. In JÁNOS PACK, editor, Towards a Theory of Geometric Graphs, vol. 342 of Contemporary Mathematics, pp. 75-86. Amer. Math. Soc., 2004.
8. ASHIM GARG AND ROBERTO TAMASSIA. On the computational complexity of upward and rectilinear planarity testing. SIAM J. Comput., 31(2):601-625, 2001.
9. ROBERT E. JAMISON. Few slopes without collinearity. Discrete Math., 60:199-206, 1986.
10. GOOS KANT. Drawing planar graphs using the canonical ordering. Algorithmica, 16(1):4-32, 1996.
11. SETH M. MALITZ. Graphs with E edges have pagenumber O(√E). J. Algorithms, 17(1):71-84, 1994.
12. MD. SAIDUR RAHMAN, TAKAO NISHIZEKI, AND SHUBHASHIS GHOSH. Rectangular drawings of planar graphs. J. Algorithms, 50:62-78, 2004.
13. MATTHEW SUDERMAN. Pathwidth and layered drawings of trees. Internat. J. Comput. Geom. Appl., 14(3):203-225, 2004.
14. PETER UNGAR. On diagrams representing maps. J. London Math. Soc., 28:336-342, 1953.
15. GREG A. WADE AND JIANG-HSING CHU. Drawability of complete graphs using a minimal slope set. The Computer Journal, 37(2):139-142, 1994.