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
Journal of Graph Algorithms and Applications, Tome 11 (2007), p. 99-143 / Harvested from The Electronic Library of Mathematics
Publié le : 2007-01-01
EUDML-ID : urn:eudml:doc:55424
@article{05493575,
     title = {Challenging complexity of maximum common subgraph detection algorithms: A performance analysis of three algorithms on a wide database of graphs.},
     journal = {Journal of Graph Algorithms and Applications},
     volume = {11},
     year = {2007},
     pages = {99-143},
     zbl = {1161.68846},
     language = {en},
     url = {http://dml.mathdoc.fr/item/05493575}
}
Conte, Donatello; Foggia, Pasquale; 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, Tome 11 (2007) pp. 99-143. http://gdmltest.u-ga.fr/item/05493575/