The parameterized complexity of geometric graph isomorphism

DOI10.1007/978-3-319-13524-3_5MaRDI QIDQ2946007zbMATH OpenOpenAlexFDO

Authors Vikraman 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) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• The parameterized complexity of geometric graph isomorphism
• On the geometric graph isomorphism problem
• On the parameterized complexity of \(d\)-dimensional point set pattern matching
• On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching
• scientific article; zbMATH DE number 1555919

Cited in

(4)

• The parameterized complexity of geometric graph isomorphism
• On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching
• Parameterized Complexity of Independence and Domination on Geometric Graphs
• On the parameterized complexity of \(d\)-dimensional point set pattern matching

This page was built for publication: The parameterized complexity of geometric graph isomorphism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946007)