The parameterized complexity of geometric graph isomorphism

DOI10.1007/s00453-015-0024-8zbMath1350.68125OpenAlexW2175392161MaRDI QIDQ309786

V. Arvind, Gaurav Rattan

Publication date: 7 September 2016

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-015-0024-8

zbMATH Keywords

latticesgraph isomorphismpoint set congruence

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)

Cites Work

• Unnamed Item
• Unnamed Item
• On the geometric graph isomorphism problem
• On determining the congruence of point sets in \(d\) dimensions
• Congruence, similarity, and symmetries of geometric objects
• Hypergraph isomorphism and structural equivalence of Boolean functions
• A Deterministic Single Exponential Time Algorithm for Most Lattice Problems Based on Voronoi Cell Computations
• TESTING THE CONGRUENCE OF d-DIMENSIONAL POINT SETS
• On the Lattice Isomorphism Problem

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