Skip to main content
SpringerLink
Log in

Unified View of Graph Searching and LDFS-Based Certifying Algorithms

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 48 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. Arikati SR, Rangan CP (1990) Linear algorithm for optimal path cover problem on interval graphs. Inf Process Lett 35(3):149–153

    Article  MathSciNet  MATH  Google Scholar 

  2. Brandstädt A, Dragan FF, Nicolai F (1997) LexBFS-orderings and powers of chordal graphs. Discret Math 171(1–3):27–42

    Article  MathSciNet  MATH  Google Scholar 

  3. Brandstädt A, Le VB, Spinrad JP (1999) Graph classes, a survey. SIAM monographs on discrete mathematics and applications. Society for Industrial and Applied Mathematics, Philadelphia

    Book  MATH  Google Scholar 

  4. Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms, 3rd edn. MIT, Cambridge

    MATH  Google Scholar 

  5. Corneil DG (2004) Lexicographic breadth first search – a survey. In: WG, Bad Honnef. Lecture notes in computer science, vol 3353. Springer, pp 1–19

    Google Scholar 

  6. Corneil DG, Krueger R (2008) A unified view of graph searching. SIAM J Discret Math 22(4):1259–1276

    Article  MathSciNet  MATH  Google Scholar 

  7. Corneil DG, Dalton B, Habib M (2013) LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs. SIAM J Comput 42(3):792–807

    Article  MathSciNet  MATH  Google Scholar 

  8. Corneil DG, Dusart J, Habib M, Kőhler E (2014) On the power of graph searching for cocomparability graphs. Submitted for publication

    Google Scholar 

  9. Corneil DG, Dusart J, Habib M, Mamcarz A, de Montgolfier F (2014) A new model for graph search. Under revision

    MATH  Google Scholar 

  10. Dalton B (2011) On minimum path cover in interval graphs. Master’s thesis, University of Toronto

    Google Scholar 

  11. Damaschke P (1993) Paths in interval graphs and circular arc graphs. Discret Math 112(1–3):49–64

    Article  MathSciNet  MATH  Google Scholar 

  12. Dusart J (2014) Graph searches with applications to cocomparability graphs. PhD thesis, University of Paris Diderot

    Google Scholar 

  13. Euler L (1736) Solutio problematis ad geometriam situs pertinentis. Comment Academiae Sci I Petropolitanae 8:128–140

    Google Scholar 

  14. Fleury (1883) Deux problèmes de géométrie de situation. Journal de mathématiques élémentaires 257–261

    Google Scholar 

  15. Gioan E, Paul C, Tedder M, Corneil DG (2014) Practical and efficient split-decomposition via graph-labelled trees. Algorithmica 69(4):789–843

    Article  MathSciNet  MATH  Google Scholar 

  16. Golumbic MC (2004) Algorithmic graph theory and perfect graphs. Annals of discrete mathematics, vol 57. Elsevier, Amsterdam/Boston

    Google Scholar 

  17. Habib M, McConnell RM, Paul C, Viennot L (2000) LexBFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theor Comput Sci 234(1–2):59–84. http://dblp.uni-trier.de/rec/bibtex/journals/tcs/HabibMPV00

  18. Ioannidou K, Mertzios GB, Nikolopoulos SD (2011) The longest path problem has a polynomial solution on interval graphs. Algorithmica 6(2):320–341

    Article  MathSciNet  MATH  Google Scholar 

  19. Köhler E, Mouatadid L (2014) A linear time algorithm for computing a maximum weight independent set on cocomparability graphs. Submitted for publication

    Google Scholar 

  20. Köhler E, Mouatadid L (2014) Linear time LDFS on cocomparability graphs. In: SWAT, Copenhagen, pp 319–330

    MATH  Google Scholar 

  21. Krueger R, Simonet G, Berry A (2011) A general label search to investigate classical graph search algorithms. Discret Appl Math 159(2–3):128–142

    Article  MathSciNet  MATH  Google Scholar 

  22. Lucas E (1882) Récréations mathématiques. Gauthier-Vilars, Paris

    MATH  Google Scholar 

  23. Mertzios GB, Corneil DG (2012) A simple polynomial algorithm for the longest path problem on cocomparability graphs. SIAM J Discret Math 26(3):940–963. http://dblp.uni-trier.de/rec/bibtex/journals/siamdm/MertziosC12

  24. Rose DJ, Tarjan RE, Lueker GS (1976) Algorithmic aspects of vertex elimination on graphs. SIAM J Comput 5(2):266–283. http://dblp.uni-trier.de/rec/bibtex/journals/siamcomp/RoseTL76

  25. Shier DR (1984) Some aspects of perfect elimination orderings in chordal graphs. Discret Appl Math 7:325–331

    Article  MathSciNet  MATH  Google Scholar 

  26. Spinrad J (–) Efficient implementation of lexicographic depth first search. Submitted for publication

    Google Scholar 

  27. Tarjan RE (1972) Depth-first search and linear graph algorithms. SIAM J Comput 1(2):146–160

    Article  MathSciNet  MATH  Google Scholar 

  28. Tarry G (1895) Le problème des labyrinthes. Nouvelles Annales de Math 14:187–189

    MATH  Google Scholar 

  29. Tedder M (2011) Applications of lexicographic breadth first search to modular decomposition, split decomposition, and circle graphs. PhD thesis, University of Toronto

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Toronto, Toronto, ON, Canada

    Derek G. Corneil

  2. LIAFA, Université Paris Diderot, F-75205, Paris Cedex 13, France

    Michel Habib

Authors
  1. Derek G. Corneil
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michel Habib
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Derek G. Corneil .

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

Corneil, D.G., Habib, M. (2016). Unified View of Graph Searching and LDFS-Based Certifying Algorithms. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_685

Download citation

Publish with us

Policies and ethics

Search

Navigation