Sciweavers

TCS
2011
13 years 7 months ago
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
The problem of computing minimum distortion embeddings of a given graph into a line (path) was introduced in 2004 and has quickly attracted significant attention with subsequent ...
Pinar Heggernes, Daniel Meister, Andrzej Proskurow...