Line-Distortion, Bandwidth and Path-Length of a Graph

  • Feodor F. Dragan
  • Ekkehard Köhler
  • Arne Leitert
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8503)


We investigate the minimum line-distortion and the minimum bandwidth problems on unweighted graphs and their relations with the minimum length of a Robertson-Seymour’s path-decomposition. The length of a path-decomposition of a graph is the largest diameter of a bag in the decomposition. The path-length of a graph is the minimum length over all its path-decompositions. In particular, we show: (i) if a graph G can be embedded into the line with distortion k, then G admits a Robertson-Seymour’s path-decomposition with bags of diameter at most k in G; (ii) for every class of graphs with path-length bounded by a constant, there exist an efficient constant-factor approximation algorithm for the minimum line-distortion problem and an efficient constant-factor approximation algorithm for the minimum bandwidth problem; (iii) there is an efficient 2-approximation algorithm for computing the path-length of an arbitrary graph; (iv) AT-free graphs and some intersection families of graphs have path-length at most 2; (v) for AT-free graphs, there exist a linear time 8-approximation algorithm for the minimum line-distortion problem and a linear time 4-approximation algorithm for the minimum bandwidth problem.


Short Path Span Tree Chordal Graph Graph Class Arbitrary Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Blache, G., Karpinski, M., Wirtgen, J.: On approximation intractability of the bandwidth problem, Technical report TR98-014, University of Bonn (1997)Google Scholar
  2. 2.
    Bădoiu, M., Chuzhoy, J., Indyk, P., Sidiropoulos, A.: Low-distortion embeddings of general metrics into the. In: STOC 2005, pp. 225–233. ACM (2005)Google Scholar
  3. 3.
    Bǎdoiu, M., Dhamdhere, K., Gupta, A., Rabinovich, Y., Raecke, H., Ravi, R., Sidiropoulos, A.: Approximation algorithms for low-distortion embeddings into low-dimensional spaces. In: SODA 2005, pp. 119–128. ACM/SIAM (2005)Google Scholar
  4. 4.
    Corneil, D.G., Olariu, S., Stewart, L.: Asteroidal Triple-Free Graphs. SIAM Journal on Discrete Mathematics 10, 399–430 (1997)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Dourisboure, Y., Gavoille, C.: Tree-decompositions with bags of small diameter. Discr. Math. 307, 208–229 (2007)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Dragan, F.F., Köhler, E.: An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs. In: Goldberg, L.A., Jansen, K., Ravi, R., Rolim, J.D.P. (eds.) RANDOM 2011 and APPROX 2011. LNCS, vol. 6845, pp. 171–183. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  7. 7.
    Feige, U.: Approximating the bandwidth via volume respecting embedding. J. of Computer and System Science 60, 510–539 (2000)CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Fellows, M.R., Fomin, F.V., Lokshtanov, D., Losievskaja, E., Rosamond, F.A., Saurabh, S.: Distortion Is Fixed Parameter Tractable. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 463–474. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  9. 9.
    Fomin, F.V., Lokshtanov, D., Saurabh, S.: An exact algorithm for minimum distortion embedding. Theor. Comput. Sci. 412, 3530–3536 (2011)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Golovach, P.A., Heggernes, P., Kratsch, D., Lokshtanov, D., Meister, D., Saurabh, S.: Bandwidth on AT-free graphs. Theor. Comput. Sci. 412, 7001–7008 (2011)CrossRefzbMATHMathSciNetGoogle Scholar
  11. 11.
    Gupta, A.: Improved Bandwidth Approximation for Trees and Chordal Graphs. J. Algorithms 40, 24–36 (2001)CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Heggernes, P., Kratsch, D., Meister, D.: Bandwidth of bipartite permutation graphs in polynomial time. Journal of Discrete Algorithms 7, 533–544 (2009)CrossRefzbMATHMathSciNetGoogle Scholar
  13. 13.
    Heggernes, P., Meister, D.: Hardness and approximation of minimum distortion embeddings. Information Processing Letters 110, 312–316 (2010)CrossRefzbMATHMathSciNetGoogle Scholar
  14. 14.
    Heggernes, P., Meister, D., Proskurowski, A.: Computing minimum distortion embeddings into a path of bipartite permutation graphs and threshold graphs. Theoretical Computer Science 412, 1275–1297 (2011)CrossRefzbMATHMathSciNetGoogle Scholar
  15. 15.
    Indyk, P., Matousek, J.: Low-distortion embeddings of finite metric spaces. In: Handbook of Discrete and Computational Geometry, pp. 177–196. CRC (2004)Google Scholar
  16. 16.
    Kloks, T., Kratsch, D., Müller, H.: Approximating the Bandwidth for Asteroidal Triple-Free Graphs. J. Algorithms 32, 41–57 (1999)CrossRefzbMATHMathSciNetGoogle Scholar
  17. 17.
    Kratsch, D., Stewart, L.: Approximating Bandwidth by Mixing Layouts of Interval Graphs. SIAM J. Discrete Math. 15, 435–449 (2002)CrossRefzbMATHMathSciNetGoogle Scholar
  18. 18.
    Monien, B.: The Bandwidth-Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete. SIAM J. Alg. Disc. Meth. 7, 505–512 (1986)CrossRefzbMATHMathSciNetGoogle Scholar
  19. 19.
  20. 20.
    Robertson, N., Seymour, P.: Graph minors. I. Excluding a forest. Journal of Combinatorial Theory, Series B 35, 39–61 (1983)CrossRefzbMATHMathSciNetGoogle Scholar
  21. 21.
    Tenenbaum, J.B., de Silva, V., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290, 2319–2323 (2000)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Feodor F. Dragan
    • 1
  • Ekkehard Köhler
    • 2
  • Arne Leitert
    • 1
  1. 1.Department of Computer ScienceKent State UniversityKentUSA
  2. 2.Mathematisches InstitutBrandenburgische Technische Universität CottbusCottbusGermany

Personalised recommendations