The graph isomorphism problem on geometric graphs
From MaRDI portal
Publication:2928583
zbMATH Open1301.05236MaRDI QIDQ2928583FDOQ2928583
Authors: Ryuhei Uehara
Publication date: 10 November 2014
Published in: Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2528/0.html
Recommendations
Analysis of algorithms and problem complexity (68Q25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cited In (9)
- Title not available (Why is that?)
- A recognition algorithm for simple-triangle graphs
- Graph isomorphism and equality of simplices
- Graph isomorphism for unit square graphs
- The motif problem: Geometric representations of sets of equivalence relations
- A vertex ordering characterization of simple-triangle graphs
- Logical Approaches to Computational Barriers
- The isomorphism problem for rose window graphs
- Recognizing simple-triangle graphs by restricted 2-chain subgraph cover
This page was built for publication: The graph isomorphism problem on geometric graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2928583)