The maximum number of edges in a three-dimensional grid-drawing.
Bose, Prosenjit, Czyzowicz, Jurek, Morin, Pat, Wood, David R. (2004)
Journal of Graph Algorithms and Applications
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Bounds for orthogonal 3-D graph drawing.”
The maximum number of edges in a three-dimensional grid-drawing.
Fully dynamic 3-dimensional orthogonal graph drawing.
Closson, M., Gartshore, S., Johansen, J., Wismath, S.K. (2001)
Journal of Graph Algorithms and Applications
Similarity:
Three-dimensional 1-bend graph drawings.
Morin, Pat, Wood, David R. (2004)
Journal of Graph Algorithms and Applications
Similarity:
1-bend 3-D orthogonal box-drawings: Two open problems solved.
Biedl, Therese (2001)
Journal of Graph Algorithms and Applications
Similarity:
Lower bounds for the number of bends in three-dimensional orthogonal graph drawings.
Wood, David R. (2003)
Journal of Graph Algorithms and Applications
Similarity:
Drawing in three dimensions with one bend per edge.
Devillers, Olivier, Everett, Hazel, Lazard, Sylvain, Pentcheva, Maria, Wismath, Stephen (2006)
Journal of Graph Algorithms and Applications
Similarity:
A split&push approach to orthogonal drawing.
Di Battista, Giuseppe, Patrignani, Maurizio (2000)
Journal of Graph Algorithms and Applications
Similarity:
Algorithms for incremental orthogonal graph drawing in three dimensions.
Papakostas, Achilleas, Tollis, Ioannis G. (1999)
Journal of Graph Algorithms and Applications
Similarity:
New lower bounds for orthogonal drawings.
Biedl, Therese C. (1998)
Journal of Graph Algorithms and Applications
Similarity:
Geometric thickness of complete graphs.
Dillencourt, Michael B., Eppstein, David, Hirschberg, Daniel S. (2000)
Journal of Graph Algorithms and Applications
Similarity:
On the perspectives opened by right angle crossing drawings.
Angelini, Patrizio, Cittadini, Luca, Didimo, Walter, Frati, Fabrizio, Di Battista, Giuseppe, Kaufmann, Michael, Symvonis, Antonios (2011)
Journal of Graph Algorithms and Applications
Similarity:
Drawing planar graphs with large vertices and thick edges.
Barequet, Gill, Goodrich, Michael T., Riley, Chris (2004)
Journal of Graph Algorithms and Applications
Similarity:
Visual analysis of one-to-many matched graphs.
Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Palladino, Pietro (2010)
Journal of Graph Algorithms and Applications
Similarity: