A split&push approach to orthogonal drawing.
Di Battista, Giuseppe, Patrignani, Maurizio (2000)
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.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Visualization of the high level structure of the internet with Hermes.”
A split&push approach to orthogonal 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:
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:
Computing radial drawings on the minimum number of circles.
Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Meijer, Henk (2005)
Journal of Graph Algorithms and Applications
Similarity:
An efficient implementation of Sugiyama's algorithm for layered graph drawing.
Eiglsperger, Markus, Siebenhaller, Martin, Kaufmann, Michael (2005)
Journal of Graph Algorithms and Applications
Similarity:
Morphing planar graph drawings with bent edges.
Lubiw, Anna, Petrick, Mark (2011)
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:
I/O-optimal algorithms for outerplanar graphs.
Maheshwari, Anil, Zeh, Norbert (2004)
Journal of Graph Algorithms and Applications
Similarity:
On the cutting edge: simplified planarity by edge addition.
Boyer, John M., Myrvold, Wendy J. (2004)
Journal of Graph Algorithms and Applications
Similarity:
Polar coordinate drawing of planar graphs with good angular resolution.
Duncan, Christian A., Kobourov, Stephen G. (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:
Drawing graphs on two and three lines.
Cornelsen, Sabine, Schank, Thomas, Wagner, Dorothea (2004)
Journal of Graph Algorithms and Applications
Similarity:
Algorithms for investigating optimality of cone triangulation for a polyhedron
Milica Stojanović, Milica Vučković (2007)
Kragujevac Journal of Mathematics
Similarity: