Graph reconstruction from unlabeled edge lengths
From MaRDI portal
Publication:2039322
DOI10.1007/s00454-021-00275-7zbMath1480.05095OpenAlexW3135415291MaRDI QIDQ2039322
Dániel Garamvölgyi, Tibor Jordán
Publication date: 2 July 2021
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-021-00275-7
Distance in graphs (05C12) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Graph representations (geometric and intersection representations, etc.) (05C62) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Globally rigid graphs are fully reconstructible, GENERIC UNLABELED GLOBAL RIGIDITY, \(K_{5, 5}\) is fully reconstructible in \(\mathbb{C}^3\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
- Highly connected rigidity matroids have unique underlying graphs
- Global rigidity: The effect of coning
- Connected rigidity matroids and unique realizations of graphs
- On reconstructing \(n\)-point configurations from the distribution of distances or areas
- Generic global rigidity
- Globally linked pairs of vertices in equivalent realizations of graphs
- Characterizing generic global rigidity
- On Generic Rigidity in the Plane
- Isomorphism Testing in Hookup Classes
- Conditions for Unique Graph Realizations
- The Rigidity of Graphs
- 2-Isomorphic Graphs
- Basic Algebraic Geometry 2
- Algebraic Matroids in Action
- GENERIC UNLABELED GLOBAL RIGIDITY
- Generic Global Rigidity in Complex and Pseudo-Euclidean Spaces
- Euclidean Distance Geometry and Applications
- Connectivity of transitive graphs
- Algorithms in real algebraic geometry
