Simultaneous graph drawing: layout algorithms and visualization schemes.
Erten, C., Kobourov, S.G., Le, V., Navabi, A. (2005)
Journal of Graph Algorithms and Applications
Similarity:
Displaying similar documents to “Challenging complexity of maximum common subgraph detection algorithms: A performance analysis of three algorithms on a wide database of graphs.”
Simultaneous graph drawing: layout algorithms and visualization schemes.
Computing and drawing isomorphic subgraphs.
Bachl, S., Brandenburg, F.-J., Gmach, D. (2004)
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:
Some general classes of comatching graphs.
Farrell, E.J., Wahid, S.A. (1987)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Navigating clustered graphs using force-directed methods.
Eades, Peter, Huang, Lin Mao (2000)
Journal of Graph Algorithms and Applications
Similarity:
Graph drawing by high-dimensional embedding.
Harel, David, Koren, Yehuda (2004)
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:
Centers in line graphs
Martin Knor, Ľudovít Niepel, Ľubomír Šoltés (1993)
Mathematica Slovaca
Similarity:
An introduction to -graphs, a graph-theoretic representation of natural numbers.
Farrell, E.J. (1992)
International Journal of Mathematics and Mathematical Sciences
Similarity:
A note on the radius of iterated line graphs.
Knor, M. (1995)
Acta Mathematica Universitatis Comenianae. New Series
Similarity: