Skip to main content
SpringerLink
Log in

Branchwidth of Graphs

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

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. Alber J, Bodlaender HL, Fernau H, Kloks T, Niedermeier R (2002) Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmica 33:461–493

    Article  MathSciNet  MATH  Google Scholar 

  2. Arnborg S (1985) Efficient algorithms for combinatorial problems on graphs with bounded decomposability – a survey. BIT 25:2–23

    Article  MathSciNet  MATH  Google Scholar 

  3. Bodlaender HL, Thilikos DM (1997) Constructive linear time algorithms for branchwidth. In: Automata, languages and programming (Bologna, 1997). Lecture notes in computer science, vol 1256. Springer, Berlin, pp 627–637

    Google Scholar 

  4. Bodlaender HL, Thilikos DM (1999) Graphs with branchwidth at most three. J Algoritm 32:167–194

    Article  MathSciNet  MATH  Google Scholar 

  5. Cook W, Seymour PD (2003) Tour merging via branch-decomposition. INFORMS J Comput 15:233–248

    Article  MathSciNet  MATH  Google Scholar 

  6. Demaine ED, Fomin FV, Hajiaghayi M, Thilikos DM (2004) Bidimensional parameters and local treewidth. SIAM J Discret Math 18:501–511

    Article  MathSciNet  MATH  Google Scholar 

  7. Demaine ED, Hajiaghayi MT, Nishimura N, Ragde P, Thilikos DM (2004) Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. J Comput Syst Sci 69:166–195

    Article  MathSciNet  MATH  Google Scholar 

  8. Dorn F, Fomin FV, Thilikos DM (2006) Subexponential algorithms for non-local problems on H-minor-free graphs. In: Proceedings of the nineteenth annual ACM-SIAM symposium on discrete algorithms (SODA 2008). Society for Industrial and Applied Mathematics, Philadelphia, pp 631–640

    Google Scholar 

  9. Dorn F (2006) Dynamic programming and fast matrix multiplication. In: Proceedings of the 14th annual European symposium on algorithms (ESA 2006). Lecture notes in computer science, vol 4168. Springer, Berlin, pp 280–291

    Google Scholar 

  10. Dorn F, Fomin FV, Thilikos DM (2005) Fast subexponential algorithm for non-local problems on graphs of bounded genus. In: Proceedings of the 10th Scandinavian workshop on algorithm theory (SWAT 2006). Lecture notes in computer science. Springer, Berlin

    Google Scholar 

  11. Dorn F, Penninkx E, Bodlaender H, Fomin FV (2005) Efficient exact algorithms on planar graphs: exploiting sphere cut branch decompositions. In: Proceedings of the 13th annual European symposium on algorithms (ESA 2005). Lecture notes in computer science, vol 3669. Springer, Berlin, pp 95–106

    Google Scholar 

  12. Downey RG, Fellows MR (1999) Parameterized complexity. In: Monographs in computer science. Springer, New York

    Google Scholar 

  13. Feige U, Hajiaghayi M, Lee JR (2005) Improved approximation algorithms for minimum-weight vertex separators. In: Proceedings of the 37th annual ACM symposium on theory of computing (STOC 2005). ACM Press, New York, pp 563–572

    Google Scholar 

  14. Fomin FV, Mazoit F, Todinca I (2005) Computing branchwidth via efficient triangulations and blocks. In: Proceedings of the 31st workshop on graph theoretic concepts in computer science (WG 2005). Lecture notes computer science, vol 3787. Springer, Berlin, pp 374–384

    Google Scholar 

  15. Fomin FV, Thilikos DM (2004) Fast parameterized algorithms for graphs on surfaces: linear kernel and exponential speed-up. In: Proceedings of the 31st international colloquium on automata, languages and programming (ICALP 2004). Lecture notes computer science, vol 3142. Springer, Berlin, pp 581–592

    Google Scholar 

  16. Fomin FV, Thilikos DM (2006) Dominating sets in planar graphs: branch-width and exponential speed-up. SIAM J Comput 36:281–309

    Article  MathSciNet  MATH  Google Scholar 

  17. Fomin FV, Thilikos DM (2006) New upper bounds on the decomposability of planar graphs. J Graph Theory 51:53–81

    Article  MathSciNet  MATH  Google Scholar 

  18. Gu QP, Tamaki H (2005) Optimal branch-decomposition of planar graphs in O(n3) time. In: Proceedings of the 32nd international colloquium on automata, languages and programming (ICALP 2005). Lecture notes computer science, vol 3580. Springer, Berlin, pp 373–384

    Google Scholar 

  19. Gu QP, Tamaki H (2006) Branch-width, parse trees, and monadic second-order logic for matroids. J Comb Theory Ser B 96:325–351

    Article  MathSciNet  Google Scholar 

  20. Kloks T, Kratochvíl J, Müller H (2005) Computing the branchwidth of interval graphs. Discret Appl Math 145:266–275

    Article  MathSciNet  MATH  Google Scholar 

  21. Mazoit F (2006) The branch-width of circular-arc graphs. In: 7th Latin American symposium on theoretical informatics (LATIN 2006)

    Google Scholar 

  22. Oum SI, Seymour P (2006) Approximating clique-width and branch-width. J Comb Theory Ser B 96:514–528

    Article  MathSciNet  MATH  Google Scholar 

  23. Paul C, Proskurowski A, Telle JA (2006) Generating graphs of bounded branchwidth. In: Proceedings of the 32nd workshop on graph theoretic concepts in computer science (WG 2006). Lecture notes computer science, vol 4271. Springer, Berlin, pp 205–216

    Google Scholar 

  24. Paul C, Telle JA (2005) New tools and simpler algorithms for branchwidth. In: Proceedings of the 13th annual European symposium on algorithms (ESA 2005)

    Google Scholar 

  25. Robertson N, Seymour PD (1991) Graph minors. X. Obstructions to tree-decomposition. J Comb Theory Ser B 52:153–190

    Article  MathSciNet  MATH  Google Scholar 

  26. Robertson N, Seymour PD (1995) Graph minors. XII. Distance on a surface. J Comb Theory Ser B 64:240–272

    Article  MathSciNet  MATH  Google Scholar 

  27. Robertson N, Seymour PD (1995) Graph minors. XIII. The disjoint paths problem. J Comb Theory Ser B 63:65–110

    Article  MathSciNet  MATH  Google Scholar 

  28. Robertson N, Seymour PD, Thomas R (1994) Quickly excluding a planar graph. J Comb Theory Ser B 62:323–348

    Article  MathSciNet  MATH  Google Scholar 

  29. Seymour PD, Thomas R (1994) Call routing and the ratcatcher. Combinatorica 14:217–241

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, University of Bergen, Bergen, Norway

    Fedor V. Fomin

  2. AlGCo Project Team, CNRS, LIRMM, France

    Dimitrios Thilikos

  3. Department of Mathematics, National and Kapodistrian University of Athens, Athens, Greece

    Dimitrios Thilikos

Authors
  1. Fedor V. Fomin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dimitrios Thilikos
    View author publications

    You can also search for this author in PubMed Google Scholar

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

Fomin, F.V., Thilikos, D. (2016). Branchwidth of Graphs. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_55

Download citation

Publish with us

Policies and ethics

Search

Navigation