Computing and drawing isomorphic subgraphs.
Bachl, S., Brandenburg, F.-J., Gmach, D. (2004)
Journal of Graph Algorithms and Applications
Similarity:
Displaying similar documents to “Simultaneous graph drawing: layout algorithms and visualization schemes.”
Computing and drawing isomorphic subgraphs.
Challenging complexity of maximum common subgraph detection algorithms: A performance analysis of three algorithms on a wide database of graphs.
Conte, Donatello, Foggia, Pasquale, Vento, Mario (2007)
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:
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:
Centers in line graphs
Martin Knor, Ľudovít Niepel, Ľubomír Šoltés (1993)
Mathematica Slovaca
Similarity:
Some general classes of comatching graphs.
Farrell, E.J., Wahid, S.A. (1987)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Centers in iterated line graphs.
Knor, M., Niepel, L., Olts, L. (1992)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Graph drawing in motion.
Friedrich, Carsten, Eades, Peter (2002)
Journal of Graph Algorithms and Applications
Similarity:
Two-radially maximal graphs with special centers
Ferdinand Gliviak, Martin Knor, Ľubomír Šoltés (1995)
Mathematica Slovaca
Similarity: