The Parameterized Complexity of Geometric Graph Isomorphism

DOI10.1007/978-3-319-13524-3_5zbMath1341.68057OpenAlexW1593431445MaRDI QIDQ2946007

V. Arvind, Gaurav Rattan

Publication date: 15 September 2015

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-13524-3_5

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

This page was built for publication: The Parameterized Complexity of Geometric Graph Isomorphism