{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:35Z","timestamp":1759638635424},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223399"},{"type":"electronic","value":"9783540278108"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27810-8_17","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T13:27:29Z","timestamp":1279027649000},"page":"187-198","source":"Crossref","is-referenced-by-count":18,"title":["A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension"],"prefix":"10.1007","author":[{"given":"Michel","family":"Habib","sequence":"first","affiliation":[]},{"given":"Fabien","family":"de Montgolfier","sequence":"additional","affiliation":[]},{"given":"Christophe","family":"Paul","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K.S. Booth","year":"1976","unstructured":"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.\u00a013, 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, 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)","DOI":"10.1137\/1.9780898719796"},{"key":"17_CR3","first-page":"132","volume-title":"proceedings of ISTCS 1997","author":"C. Capelle","year":"1997","unstructured":"Capelle, C., Habib, M.: Graph Decompositions and Factorizing Permutations. In: proceedings of ISTCS 1997, Ramat Gan, Israel, June 1997, pp. 132\u2013143. IEEE, Los Alamitos (1997)"},{"issue":"1","key":"17_CR4","first-page":"55","volume":"5","author":"C. Capelle","year":"2002","unstructured":"Capelle, C., Habib, M., de Montgolfier, F.: Graph decomposition and factorizing permutations. Discrete Mathematics and Theoretical Computer Sciences\u00a05(1), 55\u201370 (2002)","journal-title":"Discrete Mathematics and Theoretical Computer Sciences"},{"issue":"4","key":"17_CR5","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"D.G. Corneil","year":"1985","unstructured":"Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM Journal of Computing\u00a014(4), 926\u2013934 (1985)","journal-title":"SIAM Journal of Computing"},{"key":"17_CR6","unstructured":"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\u2013180 (1998)"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/BFb0017474","volume-title":"Trees in Algebra and Programming - CAAP \u201994","author":"A. Cournier","year":"1994","unstructured":"Cournier, A., Habib, M.: A new linear algorithm for modular decomposition. In: Tison, S. (ed.) CAAP 1994. LNCS, vol.\u00a0787, pp. 68\u201384. Springer, Heidelberg (1994)"},{"key":"17_CR8","unstructured":"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\u2013290 (1972)"},{"issue":"2","key":"17_CR9","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1006\/jagm.2001.1185","volume":"41","author":"E. Dahlhaus","year":"2001","unstructured":"Dahlhaus, E., Gustedt, J., McConnell, R.M.: Efficient and practical algorithms for sequential modular decomposition. Journal of Algorithms\u00a041(2), 360\u2013387 (2001)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"17_CR10","first-page":"41","volume":"8","author":"R. Ducournau","year":"1989","unstructured":"Ducournau, R., Habib, M.: La multiplicit\u00e9 de l\u2019h\u00e9ritage dans les langages \u00e0 objects. Technique et Science Informatique\u00a08(1), 41\u201362 (1989)","journal-title":"Technique et Science Informatique"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF02020961","volume":"18","author":"T. Gallai","year":"1967","unstructured":"Gallai, T.: Transitiv orientierbare Graphen. Acta Math. Acad. Sci. Hungar.\u00a018, 25\u201366 (1967)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"17_CR12","volume-title":"Algorithmic graph theory and perfect graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic graph theory and perfect graphs. Academic Press, New-York (1980)"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/BF01189070","volume":"13","author":"M. Habib","year":"1995","unstructured":"Habib, M., Huchard, M., Spinrad, J.P.: A linear algorithm to decompose inheritance graphs into modules. Algorithmica\u00a013, 573\u2013591 (1995)","journal-title":"Algorithmica"},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0304-3975(97)00241-7","volume":"234","author":"M. Habib","year":"2000","unstructured":"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\u00a0234, 59\u201384 (2000)","journal-title":"Theoretical Computer Science"},{"key":"17_CR15","unstructured":"Habib, M., de Montgolfier, F., Paul, C.: A simple linear-time modular decomposition algorithm. Research Report LIRMM, Universit\u00e9 de Montpellier 2, number RR-LIRMM-03007 (April 2003), http:\/\/www.lirmm.fr\/~montgolfier\/publications\/"},{"issue":"2","key":"17_CR16","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1142\/S0129054199000125","volume":"10","author":"M. Habib","year":"1999","unstructured":"Habib, M., Paul, C., Viennot, L.: Partition refinement techniques: an interesting algorithmic toolkit. International Journal of Foundations of Computer Science\u00a010(2), 147\u2013170 (1999)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Habib, M., Paul, C.: A simple linear time algorithm for cograph recognition. Discrete Mathematics (2004) (to appear)","DOI":"10.1016\/j.dam.2004.01.011"},{"key":"17_CR18","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/B978-0-12-417750-5.50022-1","volume-title":"Theory of Machines and Computations","author":"J. Hopcroft","year":"1971","unstructured":"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\u2013196. Academic Press, London (1971)"},{"key":"17_CR19","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. Hopcroft","year":"1974","unstructured":"Hopcroft, J., Tarjan, R.E.: Efficient planarity testing. J. Assoc. Mach.\u00a021, 549\u2013568 (1974)","journal-title":"J. Assoc. Mach."},{"key":"17_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/3-540-54945-5_49","volume-title":"Proceedings of the 2nd ACM-SIGSAM Internationnal Symposium on Symbolic and Algebraic Computation","author":"W.-L. Hsu","year":"1991","unstructured":"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.\u00a0557, pp. 52\u201360. Springer, Heidelberg (1991)"},{"key":"17_CR21","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0304-3975(02)00435-8","volume":"296","author":"W.-L. Hsu","year":"2003","unstructured":"Hsu, W.-L., McConnell, R.M.: PC-trees and circular-ones arrangements. Theoretical Computer Science\u00a0296, 99\u2013116 (2003)","journal-title":"Theoretical Computer Science"},{"key":"17_CR22","unstructured":"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\u2013545 (1994)"},{"key":"17_CR23","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","volume":"201","author":"R.M. McConnell","year":"1999","unstructured":"McConnell, R.M., Spinrad, J.P.: Modular decomposition and transitive orientation. Discrete Mathematics\u00a0201, 189\u2013241 (1999)","journal-title":"Discrete Mathematics"},{"key":"17_CR24","first-page":"45","volume":"4","author":"R.M. McConnell","year":"2000","unstructured":"McConnell, R.M., Spinrad, J.P.: Ordered vertex partitioning. Discrete Mathematics and Theoretical Computer Sciences\u00a04, 45\u201360 (2000)","journal-title":"Discrete Mathematics and Theoretical Computer Sciences"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"M\u00f6hring, R.H.: Algorithmic aspects of comparability graphs and interval graphs. In: Rival, I. (ed.) Graphs and Orders, pp. 41\u2013101. D. Reidel Pub. Comp. (1985)","DOI":"10.1007\/978-94-009-5315-4_2"},{"key":"17_CR26","first-page":"257","volume":"19","author":"R.H. M\u00f6hring","year":"1984","unstructured":"M\u00f6hring, R.H., Radermacher, F.J.: Substitution decomposition for discrete structures and connections with combinatorial optimization. Annals of Discrete Mathematics\u00a019, 257\u2013356 (1984)","journal-title":"Annals of Discrete Mathematics"},{"key":"17_CR27","unstructured":"De Montgolfier, F.: D\u00e9composition modulaire des graphes - th\u00e9orie, extensions et algorithmes. PhD Thesis, Universit\u00e9 de Montpellier (2003)"},{"issue":"6","key":"17_CR28","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM Journal on Computing\u00a016(6), 973\u2013989 (1987)","journal-title":"SIAM Journal on Computing"},{"key":"17_CR29","doi-asserted-by":"publisher","first-page":"160","DOI":"10.4153\/CJM-1971-016-5","volume":"23","author":"A. Pnueli","year":"1971","unstructured":"Pnueli, A., Even, S., Lempel, A.: Transitive orientation of graphs and identification of permutation graphs. Canad. J. Math.\u00a023, 160\u2013175 (1971)","journal-title":"Canad. J. Math."}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27810-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T21:15:20Z","timestamp":1559250920000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27810-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223399","9783540278108"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27810-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}