Skip to main content
SpringerLink
Log in

Split Decomposition via Graph-Labelled Trees

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 56 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. Bandelt H-J, Mulder HM (1986) Distance hereditary graphs. J Comb Theory Ser B 41:182–208

    Article  MathSciNet  MATH  Google Scholar 

  2. Bouchet A (1987) Reducing prime graphs and recognizing circle graphs. Combinatorica 7:243–254

    Article  MathSciNet  MATH  Google Scholar 

  3. Bretscher A, Corneil D, Habib M, Paul C (2008) A simple linear time lexbfs cograph recognition algorithm. SIAM J Discret Math 22(4):1277–1296

    Article  MathSciNet  MATH  Google Scholar 

  4. Burlet M, Uhry JP (1984) Parity graphs. Ann Discret Math 21:253–277

    MathSciNet  MATH  Google Scholar 

  5. Charbit P, de Montgolfier F, Raffinot M (2012) Linear time split decomposition revisited. SIAM J Discret Math 26(2):499–514

    Google Scholar 

  6. Chudnovsky M, Robertson N, Seymour P, Thomas R (2006) The strong perfect graph theorem. Ann Math 161:51–229

    Article  MathSciNet  MATH  Google Scholar 

  7. Cicerone S, Di Stefano G (1999) On the extension of bipartite to parity graphs. Discret Appl Math 95:181–195

    Article  MathSciNet  MATH  Google Scholar 

  8. Corneil D, Lerchs H, Stewart-Burlingham LK (1981) Complement reducible graphs. Discret Appl Math 3(1):163–174

    Article  MathSciNet  MATH  Google Scholar 

  9. Corneil D, Habib M, Lanlignel JM, Reed B, Rotics U (2012) Polynomial-time recognition of clique-width ⩽3 graphs. Discret Appl Math 160(6):834–865

    Article  MathSciNet  MATH  Google Scholar 

  10. Courcelle B, Engelfriet J, Rozenberg G (1993) Handle rewriting hypergraph grammars. J Comput Syst Sci 46:218–270

    Article  MathSciNet  MATH  Google Scholar 

  11. Cunningham WH, Edmonds J (1980) A combinatorial decomposition theory. Can J Math 32(3):734–765

    Article  MathSciNet  MATH  Google Scholar 

  12. Dahlhaus E (1994) Efficient parallel and linear time sequential split decomposition (extended abstract). In: Foundations of software technology and theoretical computer science – FSTTCS, Madras. Volume 880 of lecture notes in computer science, pp 171–180

    Google Scholar 

  13. Damiand G, Habib M, Paul C (2001) A simple paradigm for graph recognition: application to cographs and distance hereditary graphs. Theor Comput Sci 263:99–111

    Article  MathSciNet  MATH  Google Scholar 

  14. Gabor CP, Hsu WL, Suppovit KJ (1989) Recognizing circle graphs in polynomial time. J ACM 36:435–473

    Article  MathSciNet  MATH  Google Scholar 

  15. Gabow H, Tarjan R (1983) A linear-time algorithm for a special case of disjoint set union. In: Annual ACM symposium on theory of computing (STOC), Boston, pp 246–251

    Google Scholar 

  16. Gioan E, Paul C (2012) Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs. Discret Appl Math 160(6):708–733

    Article  MathSciNet  MATH  Google Scholar 

  17. Gioan E, Paul C, Tedder M, Corneil D (2013) Circle graph recognition in time \(O(n + m)\alpha (n + m)\). Algorithmica 69(4): 759–788 (2014)

    Article  MathSciNet  Google Scholar 

  18. Gioan E, Paul C, Tedder M, Corneil D (2013) Practical split-decomposition via graph-labelled trees. Algorithmica 69(4): 789–843 (2014)

    Google Scholar 

  19. Habib M, Paul C (2010) A survey on algorithmic aspects of modular decomposition. Comput Sci Rev 4:41–59

    Article  MATH  Google Scholar 

  20. Habib M, McConnell RM, Paul C, Viennot L (2000) Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theor Comput Sci 234:59–84

    Article  MathSciNet  MATH  Google Scholar 

  21. Hammer P, Maffray F (1990) Completely separable graphs. Discret Appl Math 27:85–99

    Article  MathSciNet  MATH  Google Scholar 

  22. Korte N, Möhring R (1989) An incremental linear-time algorithm for recongizing interval graphs. SIAM J Comput 18(1):68–81

    Article  MathSciNet  MATH  Google Scholar 

  23. Ma T-H, Spinrad J (1994) An O(n2) algorithm for undirected split decomposition. J Algorithms 16:145–160

    Article  MathSciNet  MATH  Google Scholar 

  24. Oum SI (2005) Graphs of bounded rank-width. PhD thesis, Princeton University

    Google Scholar 

  25. Rose DJ, Tarjan RE, Lueker GS (1976) Algorithmic aspects of vertex elimination on graphs. SIAM J Comput 5(2):266–283

    Article  MathSciNet  MATH  Google Scholar 

  26. Spinrad J (1989) Prime testing for the split decomposition of a graph. SIAM J Discret Math 2(4):590–599

    Article  MathSciNet  MATH  Google Scholar 

  27. Spinrad J (1994) Recognition of circle graphs. J Algorithms 16:264–282

    Article  MathSciNet  MATH  Google Scholar 

  28. Trotignon N (2013) Perfect graphs: a survey. Technical report 1301.5149, arxiv

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CNRS, Laboratoire d’Informatique Robotique et Microélectronique de Montpellier, Université Montpellier 2, Montpellier, France

    Christophe Paul

Authors
  1. Christophe Paul
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Christophe Paul .

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

Paul, C. (2016). Split Decomposition via Graph-Labelled Trees. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_686

Download citation

Publish with us

Policies and ethics

Search

Navigation