Skip to main content

All Questions

Filter by
Sorted by
Tagged with
11 votes
2 answers
3k views

Algorithm for embedding a graph with metric constraints

Suppose I have a graph $G$ with vertex set $V$, edge set $E \subseteq {V \choose 2}$, a poistive integer $d$, and a weight function $w:E \to \mathbb{R}^{+}$. Is there a nice algorithmic way to decide ...
Matthew Kahle's user avatar