• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Three-Dimensional Orthogonal Graph Drawing (2000)

Cached

  • Download as a PDF
  •  
  • Download as a PS

Download Links

  • [www.scs.carleton.ca]
  • [www.scs.carleton.ca]
  • [www.csse.monash.edu.au]
  • [www.cs.usyd.edu.au]
  • [www.cs.usyd.edu.au]
  • [www.scs.carleton.ca]
  • [www.scs.carleton.ca]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by David R. Wood
Citations:25 - 10 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Wood00three-dimensionalorthogonal,
    author = {David R. Wood},
    title = {Three-Dimensional Orthogonal Graph Drawing},
    booktitle = {},
    year = {2000},
    pages = {332--346}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

vi Declaration . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vii Acknowledgements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . viii List of Figures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ix List of Tables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xiii List of Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xiv I Orthogonal Graph Drawing 1 1

Citations

8882 Computers and Intractability: A Guide to the Theory of NP-completeness - Garey, Johnson - 1979
7321 Introduction to Algorithms - Cormen, Leiserson, et al. - 2001
1117 Reducability Among Combinatorial Problems - Karp - 1972
514 Graph Theory - Diestel - 2000
415 Matching Theory - Lovász, Plummer - 1986
374 Combinatorial algorithms for integrated circuit layout - Lengauer - 1990
325 Expected time bounds for selection - Floyd, Rivest - 1975
312 Graph Algorithms - Even - 1979
293 New method to color the vertices of a graph - Brelaz - 1979
283 Graph Drawing – Algorithms for the Visualization of Graphs - Battista, Eades, et al. - 1999
239 On representatives of subsets - Hall - 1935
224 Every planar map is four-colorable - Appel, Haken - 1976
143 Two algorithms for maintaining order in a list - Dietz, Sleator - 1987
141 Sur le probleme des courbes gauches en topologie, Fund - Kuratowski - 1930
133 On colouring the nodes of a network - Brooks - 1941
120 A framework for solving VLSI graph layout problems - Bhatt, Leighton - 1984
95 An algorithm for planarity testing of graphs - Lempel, Even, et al. - 1967
85 Kontaktprobleme der konformen Abbildung - Koebe - 1936
71 Kerbosch J: Finding all cliques of an undirected graph - Bron - 1973
71 R.: On the computational complexity of upward and rectilinear planarity testing - Garg, Tamassia - 2001
68 An exact algorithm for the maximum clique problem - Carraghan, Pardalos - 1990
57 A better heuristic for orthogonal graph drawings - Biedl, Kant - 1994
56 How to draw a planar graph on a grid, Combinatorica 10 - Frajsseix, Pach, et al. - 1990
54 Corrigendum: Computing an stnumbering - Even, Tarjan - 1977
51 Finding a maximum clique in an arbitrary graph - Balas, Yu - 1986
51 Knots and links in spatial graphs - Gordon - 1983
51 Area-efficient graph layouts (for VLSI - Leiserson - 1980
50 An experimental comparison of four graph drawing algorithms - BATTISTA, GARG, et al. - 1997
45 A Kuratowski theorem for the projective plane - Archdeacon - 1981
40 A.L.: Three-dimensional circuit layouts - Leighton, Rosenberg - 1986
39 A simple method for computing general positions in displaying three-dimensional objects - Kamada, Kawai - 1988
39 The role of another spatial dimension in software visualization - Koike - 1993
34 A.: Rubber bands, convex embeddings and graph connectivity. Combinatorica 8(1 - Linial, Lovász, et al. - 1988
33 2-visibility drawings of planar graphs - meier, Kant, et al. - 1996
32 de Verdière, On a new graph invariant and a criterion for planarity - Colin - 1993
32 3D graph drawing with simulated annealing - CRUZ, TWAROG
31 Representations of planar graphs - Brightwell, Scheinerman - 1993
30 de Verdière, Sur un nouvel invariant des graphes et un critère de planarité - Colin - 1990
28 Convex drawings of graphs in two and three dimensions - Chrobak, Goodrich, et al. - 1996
26 A Borsuk theorem for antipodal links and a spectral characterization of linknlessly embeddable graphs - Lovàsz, Schrijver - 1998
25 Computing orthogonal drawings with the minimum number of bends - Bertolazzi, Battista, et al.
25 Area-efficient static and incremental graph drawings - Biedl, Kaufmann - 1997
25 Drawing planar graphs using the canonical ordering. Algorithmica 16(1):4–32 - Kant - 1996
24 Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring - Balas, Xue - 1996
24 Language as a Graph - unknown authors
24 Q.-W.: Algorithms for Drawing Clustered Graphs - FENG - 1997
24 E#cient planarity testing - Hopcroft, Tarjan - 1974
23 Genus g graphs have pagenumber O - Malitz - 1994
21 Embeddability in Graphs - Liu - 1995
20 Drawing nice projections of objects in space - Bose, G'omez, et al. - 1996
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University