A fast multi-scale method for drawing large graphs.
Harel, David, Koren, Yehuda (2002)
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 “Numbering action vertices in workflow graphs”
A fast multi-scale method for drawing large graphs.
A novel approach for detection and elimination of automorphic graphs in graph databases.
Vijayalakshmi, R., Nadarajan, R., Nirmala, P., Thilaga, M. (2010)
International Journal of Open Problems in Computer Science and Mathematics. IJOPCM
Similarity:
On polynomial time decidability of induced-minor-closed classes
Jiří Matoušek, Jaroslav Nešetřil, Robin D. Thomas (1988)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Planarizing graphs---a survey and annotated bibliography.
Liebers, Annegret (2001)
Journal of Graph Algorithms and Applications
Similarity:
A multilevel algorithm for force-directed graph-drawing.
Walshaw, Chris (2003)
Journal of Graph Algorithms and Applications
Similarity:
Drawing graphs within graphs.
Holleis, Paul, Zimmermann, Thomas, Gmach, Daniel (2005)
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:
Treewidth and minimum fill-in on -trapezoid graphs.
Bodlaender, Hans L., Kloks, Ton, Kratsch, Dieter, Müller, Haiko (1998)
Journal of Graph Algorithms and Applications
Similarity:
Old and new generalizations of line graphs.
Bagga, Jay (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity: