{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:35Z","timestamp":1725558935252},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241324"},{"type":"electronic","value":"9783540305590"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30559-0_10","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T15:01:42Z","timestamp":1278082902000},"page":"117-128","source":"Crossref","is-referenced-by-count":4,"title":["Bimodular Decomposition of Bipartite Graphs"],"prefix":"10.1007","author":[{"given":"Jean-Luc","family":"Fouquet","sequence":"first","affiliation":[]},{"given":"Michel","family":"Habib","sequence":"additional","affiliation":[]},{"given":"Fabien","family":"de Montgolfier","sequence":"additional","affiliation":[]},{"given":"Jean-Marie","family":"Vanherpe","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1142\/S0129054199000368","volume":"10","author":"J. Fouquet","year":"1999","unstructured":"Fouquet, J., Giakoumakis, V., Vanherpe, J.: Bipartite graphs totally decomposable by canonical decomposition. International Journal of Fundations of Computer Science\u00a010, 513\u2013534 (1999)","journal-title":"International Journal of Fundations of Computer Science"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"734","DOI":"10.4153\/CJM-1980-057-7","volume":"32","author":"W. Cunningham","year":"1980","unstructured":"Cunningham, W., Edmonds, J.: A combinatorial decomposition theory. Canadian Journal of Mathematics\u00a032, 734\u2013765 (1980)","journal-title":"Canadian Journal of Mathematics"},{"key":"10_CR3","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, 35\u201350 (1981)","journal-title":"Discrete Mathematics"},{"key":"10_CR4","first-page":"257","volume":"19","author":"R. Mohring","year":"1984","unstructured":"Mohring, R., Radermacher, F.: 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":"10_CR5","doi-asserted-by":"crossref","unstructured":"Cournier, A., Habib, M.: A new linear Algorithm for Modular Decomposition. Lectures notes in Computer Science, pp. 68\u201384 (1994)","DOI":"10.1007\/BFb0017474"},{"key":"10_CR6","unstructured":"Dahlhaus, E., Gustedt, J., McConnell, R.: Efficient and practical modular decomposition. In: SODA 1997, pp. 26\u201335 (1997)"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","volume":"201","author":"R. McConnell","year":"1999","unstructured":"McConnell, R., Spinrad, J.: Modular decomposition and transitive orientation. Discrete Mathematics\u00a0201, 189\u2013241 (1999)","journal-title":"Discrete Mathematics"},{"key":"10_CR8","unstructured":"McConnell, R.M., de Montgolfier, F.: Linear-time modular decomposition of directed graphs. To appear in Discrete Applied Mathematics (2003)"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0012-365X(73)90100-3","volume":"6","author":"D.P. Sumner","year":"1973","unstructured":"Sumner, D.P.: Graphs indecomposable with respect to the X-join. Discrete Mathematics\u00a06, 281\u2013298 (1973)","journal-title":"Discrete Mathematics"},{"key":"10_CR10","unstructured":"de Montgolfier, F.: D\u00e9composition modulaire des graphes. Th\u00e9orie, extensions et algorithmes. PhD thesis, Universit\u00e9 Montpellier II (2003) (in French), available at \n \n http:\/\/www.lirmm.fr\/~montgolfier"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01788536","volume":"3","author":"V. Chv\u00e1tal","year":"1987","unstructured":"Chv\u00e1tal, V., Sbihi, N.: Bull-free berge graphs are perfect. Graphs Combinatorics\u00a03, 127\u2013139 (1987)","journal-title":"Graphs Combinatorics"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0166-218X(95)00090-E","volume":"72","author":"H. Everett","year":"1997","unstructured":"Everett, H., Klein, S., Reed, B.: An algorithm for finding homogeneous pairs. Discrete Applied Mathematics\u00a072, 209\u2013218 (1997)","journal-title":"Discrete Applied Mathematics"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1137\/0603021","volume":"3","author":"W. Cunningham","year":"1982","unstructured":"Cunningham, W.: Decomposition of directed graphs. SIAM Journal of algebraic and discrete methods\u00a03, 214\u2013228 (1982)","journal-title":"SIAM Journal of algebraic and discrete methods"},{"key":"10_CR14","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, 205\u2013240 (2000)","journal-title":"Journal of Algorithms"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0020-0190(01)00185-5","volume":"81","author":"V. Lozin","year":"2002","unstructured":"Lozin, V.: On maximum induced matchings in bipartite graphs. Information Processing Letters\u00a081, 7\u201311 (2002)","journal-title":"Information Processing Letters"}],"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\/978-3-540-30559-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T05:43:26Z","timestamp":1552628606000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30559-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241324","9783540305590"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30559-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}