Dynamic Complexity of Planar 3-Connected Graph Isomorphism
DOI10.1007/978-3-319-06686-8_21zbMath1408.68064arXiv1312.2141OpenAlexW1652152825MaRDI QIDQ4981166
Publication date: 24 June 2014
Published in: Computer Science - Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.2141
Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Logic in computer science (03B70) Data structures (68P05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
This page was built for publication: Dynamic Complexity of Planar 3-Connected Graph Isomorphism
