Pages that link to "Item:Q2629266"
From MaRDI portal
The following pages link to On computational complexity of length embeddability of graphs (Q2629266):
Displaying 9 items.
- On the distance and multidistance graph embeddability problem (Q334409) (← links)
- On complexity of multidistance graph recognition in \(\mathbb{R}^1\) (Q1690053) (← links)
- Minimal graphs with respect to geometric distance realizability (Q2214306) (← links)
- Turán-type results for distance graphs in an infinitesimal plane layer (Q2632552) (← links)
- On the Computational Complexity of Degenerate Unit Distance Representations of Graphs (Q3000515) (← links)
- Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces (Q3597878) (← links)
- NP-completeness for minimizing maximum edge length in grid embeddings (Q3677185) (← links)
- Graph Drawing (Q5711620) (← links)
- Complexity of recognizing multidistance graphs in \(\mathbb{R}^d\) (Q6576764) (← links)