On the recognition of unit disk graphs and the distance geometry problem with ranges
From MaRDI portal
(Redirected from Publication:499355)
Recommendations
Cites work
- Efficient graph representations
- Efficient sub-5 approximations for minimum dominating sets in unit disk graphs
- Euclidean distance geometry and applications
- Graph-Theoretic Concepts in Computer Science
- Integer realizations of disk and segment graphs
- Linear time approximation for dominating sets and independent dominating sets in unit disk graphs
- Minimum connected dominating sets and maximal independent sets in unit disk graphs
- Simple heuristics for unit disk graphs
- Solving systems of polynomial inequalities in subexponential time
- Unit disk graph recognition is NP-hard
Cited in
(6)- On the embedding of cone graphs in the line with distinct distances between neighbors
- On Embeddability of Unit Disk Graphs onto Straight Lines
- Representing graphs by disks and balls (a survey of recognition-complexity results)
- Preface
- On embeddability of unit disk graphs onto straight lines
- On forbidden induced subgraphs for unit disk graphs
This page was built for publication: On the recognition of unit disk graphs and the distance geometry problem with ranges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499355)