Challenging complexity of maximum common subgraph detection algorithms: A performance analysis of three algorithms on a wide database of graphs.

Displaying similar documents to “Challenging complexity of maximum common subgraph detection algorithms: A performance analysis of three algorithms on a wide database of graphs.”

Erten, C., Kobourov, S.G., Le, V., Navabi, A. (2005)

Journal of Graph Algorithms and Applications

Similarity:

Bachl, S., Brandenburg, F.-J., Gmach, D. (2004)

Journal of Graph Algorithms and Applications

Similarity:

Holleis, Paul, Zimmermann, Thomas, Gmach, Daniel (2005)

Journal of Graph Algorithms and Applications

Similarity:

Farrell, E.J., Wahid, S.A. (1987)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Eades, Peter, Huang, Lin Mao (2000)

Journal of Graph Algorithms and Applications

Similarity:

Harel, David, Koren, Yehuda (2004)

Journal of Graph Algorithms and Applications

Similarity:

Harel, David, Koren, Yehuda (2002)

Journal of Graph Algorithms and Applications

Similarity:

Martin Knor, Ľudovít Niepel, Ľubomír Šoltés (1993)

Mathematica Slovaca

Similarity:

Farrell, E.J. (1992)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Knor, M. (1995)

Acta Mathematica Universitatis Comenianae. New Series

Similarity: