Skip to main content
SpringerLink
Log in

A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension

  • Conference paper
Algorithm Theory - SWAT 2004 (SWAT 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3111))

Included in the following conference series:

Abstract

The first polynomial time algorithm (\(\mathcal{O}(n^4)\)) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear-time algorithms [22,7,23,9]. Although having optimal time complexity these algorithms are quite complicated and difficult to implement. In this paper we present an easily implementable linear-time algorithm for modular decomposition. This algorithm uses the notion of factorizing permutation and a new data-structure, the Ordered Chain Partitions.

For a full version of this extended abstract, see [15]

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Booth, K.S., Lueker, G.S.: Testing for the consecutive ones properties, interval graphs and graph planarity using PQ-tree algorithm. J. Comput. Syst. Sci. 13, 335–379 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  2. Brandstädt, A., Le, V.B., Spinrad, J.: SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics. In: Graph Classes: a Survey (1999)

    Google Scholar 

  3. Capelle, C., Habib, M.: Graph Decompositions and Factorizing Permutations. In: proceedings of ISTCS 1997, Ramat Gan, Israel, June 1997, pp. 132–143. IEEE, Los Alamitos (1997)

    Google Scholar 

  4. Capelle, C., Habib, M., de Montgolfier, F.: Graph decomposition and factorizing permutations. Discrete Mathematics and Theoretical Computer Sciences 5(1), 55–70 (2002)

    MATH  Google Scholar 

  5. Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM Journal of Computing 14(4), 926–934 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  6. Corneil, D.G., Olariu, S., Stewart, L.: The ultimate interval graph recognition algorithm? In: Proceedings of the ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 175–180 (1998)

    Google Scholar 

  7. Cournier, A., Habib, M.: A new linear algorithm for modular decomposition. In: Tison, S. (ed.) CAAP 1994. LNCS, vol. 787, pp. 68–84. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  8. Cowan, D.D., James, L.O., Stanton, R.G.: Graph decomposition for undirected graphs. In: Levow, R.B., Hoffman, F. (eds.) 3rd S-E Conf. Combinatorics, Graph Theory and Computing, Utilitas Math, Winnipeg, pp. 281–290 (1972)

    Google Scholar 

  9. Dahlhaus, E., Gustedt, J., McConnell, R.M.: Efficient and practical algorithms for sequential modular decomposition. Journal of Algorithms 41(2), 360–387 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  10. Ducournau, R., Habib, M.: La multiplicité de l’héritage dans les langages à objects. Technique et Science Informatique 8(1), 41–62 (1989)

    Google Scholar 

  11. Gallai, T.: Transitiv orientierbare Graphen. Acta Math. Acad. Sci. Hungar. 18, 25–66 (1967)

    Article  MATH  MathSciNet  Google Scholar 

  12. Golumbic, M.C.: Algorithmic graph theory and perfect graphs. Academic Press, New-York (1980)

    MATH  Google Scholar 

  13. Habib, M., Huchard, M., Spinrad, J.P.: A linear algorithm to decompose inheritance graphs into modules. Algorithmica 13, 573–591 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  14. Habib, M., McConnell, R., Paul, C., Viennot, L.: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theoretical Computer Science 234, 59–84 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  15. Habib, M., de Montgolfier, F., Paul, C.: A simple linear-time modular decomposition algorithm. Research Report LIRMM, Université de Montpellier 2, number RR-LIRMM-03007 (April 2003), http://www.lirmm.fr/~montgolfier/publications/

  16. Habib, M., Paul, C., Viennot, L.: Partition refinement techniques: an interesting algorithmic toolkit. International Journal of Foundations of Computer Science 10(2), 147–170 (1999)

    Article  MathSciNet  Google Scholar 

  17. Habib, M., Paul, C.: A simple linear time algorithm for cograph recognition. Discrete Mathematics (2004) (to appear)

    Google Scholar 

  18. Hopcroft, J.: An n log n algorithm for minimizing states in a finite automaton. In: Kohavi, Z., Paz, A. (eds.) Theory of Machines and Computations, New York, pp. 189–196. Academic Press, London (1971)

    Google Scholar 

  19. Hopcroft, J., Tarjan, R.E.: Efficient planarity testing. J. Assoc. Mach. 21, 549–568 (1974)

    MATH  MathSciNet  Google Scholar 

  20. Hsu, W.-L., Ma, T.-H.: Substitution decomposition on chordal graphs and applications. In: Hsu, W.-L., Lee, R.C.T. (eds.) ISA 1991. LNCS, vol. 557, pp. 52–60. Springer, Heidelberg (1991)

    Google Scholar 

  21. Hsu, W.-L., McConnell, R.M.: PC-trees and circular-ones arrangements. Theoretical Computer Science 296, 99–116 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  22. McConnell, R.M., Spinrad, J.: Linear-time modular decomposition and efficient transitive orientation of comparability graphs. In: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 536–545 (1994)

    Google Scholar 

  23. McConnell, R.M., Spinrad, J.P.: Modular decomposition and transitive orientation. Discrete Mathematics 201, 189–241 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  24. McConnell, R.M., Spinrad, J.P.: Ordered vertex partitioning. Discrete Mathematics and Theoretical Computer Sciences 4, 45–60 (2000)

    MATH  MathSciNet  Google Scholar 

  25. Möhring, R.H.: Algorithmic aspects of comparability graphs and interval graphs. In: Rival, I. (ed.) Graphs and Orders, pp. 41–101. D. Reidel Pub. Comp. (1985)

    Google Scholar 

  26. Möhring, R.H., Radermacher, F.J.: Substitution decomposition for discrete structures and connections with combinatorial optimization. Annals of Discrete Mathematics 19, 257–356 (1984)

    Google Scholar 

  27. De Montgolfier, F.: Décomposition modulaire des graphes - théorie, extensions et algorithmes. PhD Thesis, Université de Montpellier (2003)

    Google Scholar 

  28. Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM Journal on Computing 16(6), 973–989 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  29. Pnueli, A., Even, S., Lempel, A.: Transitive orientation of graphs and identification of permutation graphs. Canad. J. Math. 23, 160–175 (1971)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CNRS – LIRMM, 161 rue Ada, 34392, Montpellier Cedex 5, France

    Michel Habib, Fabien de Montgolfier & Christophe Paul

Authors
  1. Michel Habib
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fabien de Montgolfier
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christophe Paul
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität Augsburg, 86135, Augsburg, Germany

    Torben Hagerup

  2. Department of Computing, University of Copenhagen, Denmark

    Jyrki Katajainen

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Habib, M., de Montgolfier, F., Paul, C. (2004). A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension. In: Hagerup, T., Katajainen, J. (eds) Algorithm Theory - SWAT 2004. SWAT 2004. Lecture Notes in Computer Science, vol 3111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27810-8_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27810-8_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22339-9

  • Online ISBN: 978-3-540-27810-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation