A multilevel algorithm for force-directed graph-drawing.
Walshaw, Chris (2003)
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.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Walshaw, Chris (2003)
Journal of Graph Algorithms and Applications
Similarity:
Harel, David, Koren, Yehuda (2002)
Journal of Graph Algorithms and Applications
Similarity:
Klukas, Christian, Koschützki, Dirk, Schreiber, Falk (2005)
Journal of Graph Algorithms and Applications
Similarity:
Liebers, Annegret (2001)
Journal of Graph Algorithms and Applications
Similarity:
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...
José Cáceres, Alberto Márquez (1997)
Mathematica Bohemica
Similarity:
In this work, we get a combinatorial characterization for maximal generalized outerplanar graphs (mgo graphs). This result yields a recursive algorithm testing whether a graph is a mgo graph or not.
Jiří Matoušek, Jaroslav Nešetřil, Robin D. Thomas (1988)
Commentationes Mathematicae Universitatis Carolinae
Similarity: