Pages that link to "Item:Q334409"

The following pages link to On the distance and multidistance graph embeddability problem (Q334409):

Displaying 9 items.

• A linear-space algorithm for distance preserving graph embedding (Q1005326) (← links)
• A divide-and-conquer strategy for embedding a distance-net point set into \(E^ n\) and its application (Q1344421) (← links)
• On complexity of multidistance graph recognition in \(\mathbb{R}^1\) (Q1690053) (← links)
• On distance subgraphs of graphs in spaces of lower dimensions (Q1948589) (← links)
• Estimate of the number of edges in special subgraphs of a distance graph (Q2191968) (← links)
• On computational complexity of length embeddability of graphs (Q2629266) (← links)
• On the Computational Complexity of Degenerate Unit Distance Representations of Graphs (Q3000515) (← links)
• (Q4800121) (← links)
• (Q5360900) (← links)