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 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 particular, we solve this problem in polynomial time for bipartite permutation graphs and threshold graphs. For both graph classes, the distortion can be arbitrarily large. The graphs that we consider are unweighted.

• Type: Journal
• Year: 2011
• Where: TCS
• Authors: Pinar Heggernes, Daniel Meister, Andrzej Proskurowski
• Keywords: Bipartite Permutation Graphs, Graph Classes, Minimum Distortion Embeddings, TCS 2011, Theoretical Computer Science