Journal of Graph Algorithms and Applications
|Home||Issues||About JGAA||Instructions for Authors|
A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs
Vol. 22, no. 4, pp. 607-616, 2018. Concise paper.
Abstract 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:
Submitted: May 2018.
Reviewed: August 2018.
Revised: October 2018.
Accepted: December 2018.
Final: December 2018.
Published: December 2018.
Communicated by Giuseppe Liotta