The parameterized complexity of geometric graph isomorphism
From MaRDI portal
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph representations (geometric and intersection representations, etc.) (05C62) 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)
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
Cites work
- A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
- Congruence, similarity, and symmetries of geometric objects
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- Hypergraph isomorphism and structural equivalence of Boolean functions
- On determining the congruence of point sets in \(d\) dimensions
- On the geometric graph isomorphism problem
- On the lattice isomorphism problem
- TESTING THE CONGRUENCE OF d-DIMENSIONAL POINT SETS
- The complexity of low-distortion embeddings between point sets
Cited in
(5)- On the geometric graph isomorphism problem
- On the parameterized complexity of \(d\)-dimensional point set pattern matching
- The parameterized complexity of geometric graph isomorphism
- 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 Q309786)
