Dynamic WWW structures in .
Brandes, Ulrik, Kääb, Vanessa, Löh, Andres, Wagner, Dorothea, Willhalm, Thomas (2000)
Journal of Graph Algorithms and Applications
Similarity:
Displaying similar documents to “Using graph layout to visualize train interconnection data.”
Dynamic WWW structures in .
Drawing clustered graphs on an orthogonal grid.
Eades, Peter, Feng, Qingwen, Nagamochi, Hiroshi (1999)
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:
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:
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:
Visual ranking of link structures.
Brandes, Ulrik, Cornelsen, Sabine (2003)
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:
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:
Planarizing graphs---a survey and annotated bibliography.
Liebers, Annegret (2001)
Journal of Graph Algorithms and Applications
Similarity:
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:
Geometric thickness of complete graphs.
Dillencourt, Michael B., Eppstein, David, Hirschberg, Daniel S. (2000)
Journal of Graph Algorithms and Applications
Similarity: