Train tracks and confluent drawings

Lecture Notes in Computer Science

Volumn 3383, Issue , 2004, Pages 318-328

  Hui, Peter ^a   Schaefer, Marcus ^a   Štefankovic, Daniel ^b  

^a DEPAUL UNIVERSITY   (United States)

^b THE UNIVERSITY OF CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONFLUENT GRAPHS; GRAPH VISUALIZATION; PLANAR GRAPHS; TREE-CONFLUENT GRAPHS; CHORDAL BIPARTITE GRAPH; NATURAL GENERALIZATION; PLANAR GRAPH; POLYNOMIAL-TIME; TRAIN TRACKS;

GRAPH THEORY; MAPPING; POLYNOMIALS; TREES (MATHEMATICS); VISUALIZATION; DRAWING (GRAPHICS); FORESTRY; GRAPHIC METHODS; POLYNOMIAL APPROXIMATION;

DRAWING (GRAPHICS); TREES (MATHEMATICS);

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

References (7)

1. Giuseppe Di Battista, Peter Eades, Roberto Tamassia, and Ioannis G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, 1999.
2. Matthew T. Dickerson, David Eppstein, Michael T. Goodrich, and Jeremy Yu Meng. Confluent drawings: visualizing non-planar diagrams in a planar way. In Proc. 11th Int. Symp. Graph Drawing (GD 2003), Lecture Notes in Computer Science. Springer-Verlag, 2003.
3. David Eppstein, 2004. personal communication.
4. Michael R. Garey and David S. Johnson. Crossing number is NP-complete. SIAM Journal on Algebraic and Discrete Methods, 4(3):312-316, 1983.
5. M. Golombic and C. F. Goss. Perfect elimination and chordal bipartite graphs. J. Graph Theory, 2:155-163, 1978.
6. R. C. Penner and J. L. Harer. Combinatorics of train tracks, volume 125 of Annals of mathematics studies. Princeton University Press, 1992.
7. Marcus Schaefer, Eric Sedgwick, and Daniel Štefankovič. Recognizing string graphs in NP. J. Comput. System Sci., 67(2):365-380, 2003. Special issue on STOC2002 (Montreal, QC).