{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:38:59Z","timestamp":1725471539229},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540483816"},{"type":"electronic","value":"9783540483823"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11917496_25","type":"book-chapter","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T02:16:13Z","timestamp":1161137773000},"page":"278-288","source":"Crossref","is-referenced-by-count":1,"title":["Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms"],"prefix":"10.1007","author":[{"given":"B. -M. Bui","family":"Xuan","sequence":"first","affiliation":[]},{"given":"M.","family":"Habib","sequence":"additional","affiliation":[]},{"given":"V.","family":"Limouzy","sequence":"additional","affiliation":[]},{"given":"F.","family":"de Montgolfier","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"25_CR1","first-page":"117","volume":"8","author":"C. Allauzen","year":"2003","unstructured":"Allauzen, C., Mohri, M.: Efficient algorithms for testing the twins property. Journal of Automata, Languages and Combinatorics\u00a08(2), 117\u2013144 (2003)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"issue":"1-3","key":"25_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2003.12.010","volume":"149","author":"J. Bioch","year":"2005","unstructured":"Bioch, J.: The complexity of modular decomposition of boolean functions. Discrete Applied Mathematics\u00a0149(1-3), 1\u201313 (2005)","journal-title":"Discrete Applied Mathematics"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/11602613_16","volume-title":"Algorithms and Computation","author":"B.-M. Bui Xuan","year":"2005","unstructured":"Bui Xuan, B.-M., Habib, M., Paul, C.: Revisiting T. Uno and M. Yagiura\u2019s Algorithm. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 146\u2013155. Springer, Heidelberg (2005)"},{"issue":"1","key":"25_CR4","first-page":"55","volume":"5","author":"C. Capelle","year":"2002","unstructured":"Capelle, C., Habib, M., de Montgolfier, F.: Graph decomposition and factorizing permutations. D.M.T.C.S.\u00a05(1), 55\u201370 (2002)","journal-title":"D.M.T.C.S."},{"issue":"1","key":"25_CR5","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0012-365X(81)90138-2","volume":"37","author":"M. Chein","year":"1981","unstructured":"Chein, M., Habib, M., Maurer, M.C.: Partitive hypergraphs. Discrete Mathematics\u00a037(1), 35\u201350 (1981)","journal-title":"Discrete Mathematics"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. Springer, Heidelberg (1994)"},{"issue":"2","key":"25_CR7","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1006\/jagm.2000.1090","volume":"36","author":"E. Dahlhaus","year":"2000","unstructured":"Dahlhaus, E.: Parallel algorithms for hierarchical clustering, and applications to split decomposition and parity graph recognition. Journal of Algorithms\u00a036(2), 205\u2013240 (2000)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"25_CR8","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":"70","key":"25_CR9","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0304-3975(90)90129-6","volume":"3","author":"A. Ehrenfeucht","year":"1990","unstructured":"Ehrenfeucht, A., Rozenberg, G.: Theory of 2-structures. Theoretical Computer Science\u00a03(70), 277\u2013342 (1990)","journal-title":"Theoretical Computer Science"},{"key":"25_CR10","volume-title":"Submodular Functions and Optimization","author":"S. Fujishige","year":"1991","unstructured":"Fujishige, S.: Submodular Functions and Optimization. North-Holland, Amsterdam (1991)"},{"key":"25_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."},{"issue":"2","key":"25_CR12","first-page":"147","volume":"10","author":"M. Habib","year":"1999","unstructured":"Habib, M., Paul, C., Viennot, L.: Partition refinement techniques: An interesting algorithmic tool kit. I.J.F.C.S.\u00a010(2), 147\u2013170 (1999)","journal-title":"I.J.F.C.S."},{"issue":"2","key":"25_CR13","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.dam.2004.02.017","volume":"145","author":"R.M. McConnell","year":"2005","unstructured":"McConnell, R.M., de Montgolfier, F.: Linear-time modular decomposition of directed graphs. Discrete Applied Mathematics\u00a0145(2), 189\u2013209 (2005)","journal-title":"Discrete Applied Mathematics"},{"key":"25_CR14","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 Maths.\u00a0201, 189\u2013241 (1999); Extended abstract at SODA 1994","journal-title":"Discrete Maths."},{"key":"25_CR15","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"},{"issue":"6","key":"25_CR16","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 J. Comput.\u00a016(6), 973\u2013989 (1987)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"25_CR17","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/s004539910014","volume":"26","author":"T. Uno","year":"2000","unstructured":"Uno, T., Yagiura, M.: Fast algorithms to enumerate all common intervals of two permutations. Algorithmica\u00a026(2), 290\u2013309 (2000)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11917496_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T00:19:29Z","timestamp":1552263569000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11917496_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540483816","9783540483823"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11917496_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}