Highly Influenced

# Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs

@article{Heggernes2011ComputingMD, title={Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs}, author={Pinar Heggernes and Daniel Meister and Andrzej Proskurowski}, journal={Theor. Comput. Sci.}, year={2011}, volume={412}, pages={1275-1297} }

- Published 2011 in Theor. Comput. Sci.
DOI:10.1016/j.tcs.2011.01.005

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 results appearing in recent stoc and soda conferences. So far all such results concern approximation algorithms or exponential-time exact algorithms. We give the first polynomial-time algorithms for computing minimum distortion embeddings of graphs into a path when the input graphs belong to specific graph classes. In… CONTINUE READING