Minimum Distortion Embeddings into a Path of Bipartite Permutation 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.

[1]  Dieter Kratsch,et al.  Bandwidth of Bipartite Permutation Graphs in Polynomial Time , 2008, LATIN.

[2]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[3]  Piotr Indyk,et al.  Algorithmic applications of low-distortion geometric embeddings , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[4]  Mihai Badoiu,et al.  Approximation algorithms for low-distortion embeddings into low-dimensional spaces , 2005, SODA '05.

[6]  M. Golumbic.  Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .

[7]  Jirí Matousek,et al.  Low-Distortion Embeddings of Finite Metric Spaces , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[8]  J. Tenenbaum,et al.  A global geometric framework for nonlinear dimensionality reduction. , 2000, Science.

[9]  Marek Karpinski,et al.  On Approximation Intractability of the Bandwidth Problem , 1997, Electron. Colloquium Comput. Complex..

[10]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[11]  Alan P. Sprague.  An 0(n log n) Algorithm for Bandwidth of Interval Graphs , 1994, SIAM J. Discret. Math..

[12]  Joseph O'Rourke,et al.  Handbook of Discrete and Computational Geometry, Second Edition , 1997 .

[13]  Yuval Rabani,et al.  Low distortion maps between point sets , 2004, STOC '04.

[14]  G. Khosrovshahi,et al.  Computing the bandwidth of interval graphs , 1990 .

[15]  Piotr Indyk,et al.  Low-distortion embeddings of general metrics into the line , 2005, STOC '05.

[16]  Jeremy P. Spinrad,et al.  Bipartite permutation graphs , 1987, Discret. Appl. Math..

[17]  N. Mahadev,et al.  Threshold graphs and related topics , 1995 .

[18]  Christos H. Papadimitriou,et al.  The complexity of low-distortion embeddings between point sets , 2005, SODA '05.

[19]  B. Monien.  The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete , 1986 .