A multilevel algorithm for force-directed graph-drawing.
Walshaw, Chris (2003)
Journal of Graph Algorithms and Applications
Similarity:
Displaying similar documents to “A fast multi-scale method for drawing large graphs.”
A multilevel algorithm for force-directed graph-drawing.
Experimental comparison of graph drawing algorithms for cubic graphs.
Calamoneri, Tiziana, Jannelli, Simone, Petreschi, Rossella (1999)
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:
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 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:
Drawing clustered graphs on an orthogonal grid.
Eades, Peter, Feng, Qingwen, Nagamochi, Hiroshi (1999)
Journal of Graph Algorithms and Applications
Similarity:
GRIP: Graph drawing with intelligent placement.
Gajer, Pawel, Kobourov, Stephen G. (2002)
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:
Numbering action vertices in workflow graphs
Zoltán Ádám Mann (2010)
International Journal of Applied Mathematics and Computer Science
Similarity:
Workflow graphs, consisting of actions, events, and logical switches, are used to model business processes. In order to easily identify the actions within a workflow graph, it is useful to number them in such a way that the numbering reflects the structure of the workflow. However, available tools offer only rudimental numbering schemes. In the paper, a set of natural requirements is defined that a logical numbering should fulfill. It is investigated under what conditions there is an...