Geodesic
A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs
Journal of Graph Algorithms and Applications, Tome 22 (2018) no. 4, pp. 607-616.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

Schietgat, Ramon and Bruynooghe [Schietgal et al., AMAI, 2013] proposed a polynomial-time algorithm for computing a maximum common subgraph under the block-and-bridge preserving subgraph isomorphism (BBP-MCS) for outerplanar graphs. We show that the article contains the following errors: The running time of the presented approach is claimed to be $\mathcal{O}(n^{2.5})$ for two graphs of order $n$. We show that the algorithm of the authors allows no better bound than $\mathcal{O}(n^4)$ when using state-of-the-art general purpose methods to solve the matching instances arising as subproblems. This is even true for the special case, where both input graphs are trees. The article suggests that the dissimilarity measure derived from BBP-MCS is a metric. We show that the triangle inequality is not always satisfied and, hence, it is not a metric. Therefore, the dissimilarity measure should not be used in combination with techniques that rely on or exploit the triangle inequality in any way. Where possible, we give hints on techniques that are suitable to improve the algorithm. 
@article{JGAA_2018_22_4_a2,
     author = {Nils Kriege and Andre Droschinsky and Petra Mutzel},
     title = {A note on block-and-bridge preserving maximum common subgraph algorithms
for outerplanar graphs},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {607--616},
     publisher = {mathdoc},
     volume = {22},
     number = {4},
     year = {2018},
     doi = {10.7155/jgaa.00480},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00480/}
}
TY  - JOUR
AU  - Nils Kriege
AU  - Andre Droschinsky
AU  - Petra Mutzel
TI  - A note on block-and-bridge preserving maximum common subgraph algorithms
for outerplanar graphs
JO  - Journal of Graph Algorithms and Applications
PY  - 2018
SP  - 607
EP  - 616
VL  - 22
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00480/
DO  - 10.7155/jgaa.00480
LA  - en
ID  - JGAA_2018_22_4_a2
ER  - 
%0 Journal Article
%A Nils Kriege
%A Andre Droschinsky
%A Petra Mutzel
%T A note on block-and-bridge preserving maximum common subgraph algorithms
for outerplanar graphs
%J Journal of Graph Algorithms and Applications
%D 2018
%P 607-616
%V 22
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00480/
%R 10.7155/jgaa.00480
%G en
%F JGAA_2018_22_4_a2
Nils Kriege; Andre Droschinsky; Petra Mutzel. A note on block-and-bridge preserving maximum common subgraph algorithms
for outerplanar graphs. Journal of Graph Algorithms and Applications, Tome 22 (2018) no. 4, pp. 607-616. doi : 10.7155/jgaa.00480. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00480/

Cité par Sources :