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

Conte, Donatello, Foggia, Pasquale, and Vento, Mario. "Challenging complexity of maximum common subgraph detection algorithms: A performance analysis of three algorithms on a wide database of graphs.." Journal of Graph Algorithms and Applications 11.1 (2007): 99-143. <http://eudml.org/doc/55424>.

@article{Conte2007,
author = {Conte, Donatello, Foggia, Pasquale, Vento, Mario},
journal = {Journal of Graph Algorithms and Applications},
keywords = {graph matching algorithms},
language = {eng},
number = {1},
pages = {99-143},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {Challenging complexity of maximum common subgraph detection algorithms: A performance analysis of three algorithms on a wide database of graphs.},
url = {http://eudml.org/doc/55424},
volume = {11},
year = {2007},
}

TY - JOUR
AU - Conte, Donatello
AU - Foggia, Pasquale
AU - Vento, Mario
TI - Challenging complexity of maximum common subgraph detection algorithms: A performance analysis of three algorithms on a wide database of graphs.
JO - Journal of Graph Algorithms and Applications
PY - 2007
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 11
IS - 1
SP - 99
EP - 143
LA - eng
KW - graph matching algorithms
UR - http://eudml.org/doc/55424
ER -