Skip to main content
SpringerLink
Log in

Exact Algorithms for Bandwidth

  • Reference work entry
  • First Online:
Book cover Encyclopedia of Algorithms

  • 47 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Bodlaender HL, Fellows MR, Hallett MT (1994) Beyond np-completeness for problems of bounded width: hardness for the W hierarchy. In: Leighton FT, Goodrich MT (eds) Proceedings of the twenty-sixth annual ACM symposium on theory of computing, Montréal, 23–25 May 1994. ACM, pp 449–458, doi:10.1145/195058.195229. http://doi.acm.org/10.1145/195058.195229

  2. Cygan M, Pilipczuk M (2008) Faster exact bandwidth. In: Broersma H, Erlebach T, Friedetzky T, Paulusma D (eds) Graph-theoretic concepts in computer science, 34th international workshop, WG 2008, Durham, June 30–July 2, 2008. Revised papers, Lecture notes in computer science, vol 5344, pp 101–109. doi:10.1007/978-3-540-92248-3_10. http://dx.doi.org/10.1007/978-3-540-92248-3_10

  3. Cygan M, Pilipczuk M (2010) Exact and approximate bandwidth. Theor Comput Sci 411(40–42):3701–3713. doi:10.1016/j.tcs.2010.06.018. http://dx.doi.org/10.1016/j.tcs.2010.06.018

  4. Cygan M, Pilipczuk M (2012) Bandwidth and distortion revisited. Discret Appl Math 160(4–5):494–504. doi:10.1016/j.dam.2011.10.032. http://dx.doi.org/10.1016/j.dam.2011.10.032

  5. Cygan M, Pilipczuk M (2012) Even faster exact bandwidth. ACM Trans Algorithms 8(1):8. doi:10.1145/2071379.2071387. http://doi.acm.org/10.1145/2071379.2071387

  6. Feige U (2000) Coping with the np-hardness of the graph bandwidth problem. In: Halldórsson MM (ed) Proceedings of the 7th Scandinavian workshop on algorithm theory (SWAT), Bergen. Lecture notes in computer science, vol 1851. Springer, pp 10–19

    Google Scholar 

  7. Fomin FV, Lokshtanov D, Saurabh S (2011) An exact algorithm for minimum distortion embedding. Theor Comput Sci 412(29):3530–3536. doi:10.1016/j.tcs.2011.02.043. http://dx.doi.org/10.1016/j.tcs.2011.02.043

  8. Saxe J (1980) Dynamic programming algorithms for recognizing small-bandwidth graphs in polynomial time. SIAM J Algebr Methods 1:363–369

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, University of Warsaw, Warsaw, Poland

    Marek Cygan

Authors
  1. Marek Cygan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marek Cygan .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Cygan, M. (2016). Exact Algorithms for Bandwidth. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_513

Download citation

Publish with us

Policies and ethics

Search

Navigation