Home | Issues | About JGAA | Instructions for Authors |
DOI: 10.7155/jgaa.00094
Algorithm and Experiments in Testing Planar Graphs for Isomorphism
Vol. 8, no. 3, pp. 313-356, 2004. Regular paper.
Abstract We give an algorithm for isomorphism testing of planar graphs suitable for
practical implementation. The algorithm is based on the decomposition of a
graph into biconnected components and further into SPQR-trees. We provide a
proof of the algorithm's correctness and a complexity analysis. We determine
the conditions in which the implemented algorithm outperforms other graph
matchers, which do not impose topological restrictions on graphs. We report
experiments with our planar graph matcher tested against McKay's, Ullmann's,
and SUBDUE's (a graph-based data mining system) graph matchers.
|
Journal Supporters
|