Confluent drawings: visualizing non-planar diagrams in a planar way.
Dickerson, Matthew, Eppstein, David, Goodrich, Michael T., Meng, Jeremy Y. (2005)
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 “Drawing clustered graphs on an orthogonal grid.”
Confluent drawings: visualizing non-planar diagrams in a planar way.
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:
Straight-line drawings on restricted integer grids in two and three dimensions.
Felsner, Stefan, Liotta, Giuseppe, Wismath, Stephen (2003)
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:
Planarizing graphs---a survey and annotated bibliography.
Liebers, Annegret (2001)
Journal of Graph Algorithms and Applications
Similarity:
Experimental comparison of graph drawing algorithms for cubic graphs.
Calamoneri, Tiziana, Jannelli, Simone, Petreschi, Rossella (1999)
Journal of Graph Algorithms and Applications
Similarity:
Bar -visibility graphs.
Dean, Alice M., Evans, William, Gethner, Ellen, Laison, Joshua D., Safari, Mohammad Ali, Trotter, William T. (2007)
Journal of Graph Algorithms and Applications
Similarity:
Connectivity of planar graphs.
de Fraysseix, Hubert, Ossona de Mendez, Patrice (2001)
Journal of Graph Algorithms and Applications
Similarity:
Listing all plane graphs.
Yamanaka, Katsuhisa, Nakano, Shin-Ichi (2009)
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:
A fast multi-scale method for drawing large graphs.
Harel, David, Koren, Yehuda (2002)
Journal of Graph Algorithms and Applications
Similarity:
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:
Parameters of bar -visibility graphs.
Felsner, Stefan, Massow, Mareike (2008)
Journal of Graph Algorithms and Applications
Similarity: