Algorithm and Experiments in Testing Planar Graphs for Isomorphism
From MaRDI portal
Publication:3378501
DOI10.7155/jgaa.00094zbMath1084.05046MaRDI QIDQ3378501
Jacek P. Kukluk, Diane J. Cook, Lawrence B. Holder
Publication date: 3 April 2006
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/52212
05C85: Graph algorithms (graph-theoretic aspects)
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
Related Items
The isomorphism problem for planar 3-connected graphs is in unambiguous logspace, Filtering graphs to check isomorphism and extracting mapping by using the conductance electrical model
Uses Software