{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T08:45:36Z","timestamp":1751877936395},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540564027"},{"type":"electronic","value":"9783540475545"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56402-0_49","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:09:34Z","timestamp":1330254574000},"page":"212-224","source":"Crossref","is-referenced-by-count":6,"title":["An efficient algorithm to recognize prime undirected graphs"],"prefix":"10.1007","author":[{"given":"Cournier","family":"Alain","sequence":"first","affiliation":[]},{"given":"Habib","family":"Michel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0012-365X(81)90138-2","volume":"37","author":"M. Chein","year":"1981","unstructured":"M. Chein, M. Habib, and M. C. Maurer. Partitive hypergraphs. Discrete Mathematics, (37):35\u201350, 1981.","journal-title":"Discrete Mathematics"},{"key":"20_CR2","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"D. G. Corneil","year":"1985","unstructured":"D. G. Corneil, Y. Perl, and L. K. Stewart. A linear recognition algorithm for cographs. SIAM journal of computing, (14):926\u2013934, 1985.","journal-title":"SIAM journal of computing"},{"key":"20_CR3","unstructured":"M. Habib. Substitution des structures combinatoires, th\u00e9orie et algorithmes, th\u00e8se d'\u00e9tat, Paris VI, 1981."},{"key":"20_CR4","first-page":"198","volume":"3","author":"M. Habib","year":"1979","unstructured":"M. Habib and M. C. Maurer. On the X-join decomposition for undirected graphs. J. Discrete Applied Math, (3):198\u2013207, 1979.","journal-title":"J. Discrete Applied Math"},{"key":"20_CR5","unstructured":"P. Ille. Indecomposable relations. preprint Universit\u00e9 de Marseille, 1990."},{"key":"20_CR6","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1002\/malq.19910371306","volume":"37","author":"P. Ille","year":"1991","unstructured":"P. Ille. L'ensemble des intervalles d'une multirelation binaire et reflexive. Zeitschr. f. math. Logik und Grundlagen d. Math. Bd., (37):227\u2013256, 1991.","journal-title":"Zeitschr. f. math. Logik und Grundlagen d. Math. Bd."},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"D. Kelly. Graphs and Orders, chapter Comparability graphs, pages 3\u201340. D. Reidel Publishing Company, 1985.","DOI":"10.1007\/978-94-009-5315-4_1"},{"key":"20_CR8","first-page":"257","volume":"19","author":"R. H. M\u00f6ring","year":"1984","unstructured":"R. H. M\u00f6ring and F. J. Radermacher. Substitution decomposition for discrete structures and connections with combinatorial optimization. Ann. Discrete math, (19):257\u2013356, 1984.","journal-title":"Ann. Discrete math"},{"key":"20_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/58562.59300","volume":"1","author":"J. H. Muller","year":"1989","unstructured":"J. H. Muller and J. Spinrad. Incremental modular decomposition. Journal of the association for Computing Machinery, (1):1\u201319, January 1989.","journal-title":"Journal of the association for Computing Machinery"},{"key":"20_CR10","volume-title":"preprint","author":"J. Spinrad","year":"1989","unstructured":"J. Spinrad. P4-trees and substitution decomposition. preprint, Vanderbild U., Nashville, 1989."},{"key":"20_CR11","unstructured":"J. H. Schmerl and W. T. Trotter. Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures. preprint, 1991."},{"key":"20_CR12","doi-asserted-by":"crossref","first-page":"2811","DOI":"10.1016\/0012-365X(73)90100-3","volume":"6","author":"D. P. Sumner","year":"1973","unstructured":"D. P. Sumner. Graphs indecomposable with respect to the X-join. Discrete Mathematics, 6:2811\u2013298, 1973.","journal-title":"Discrete Mathematics"}],"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\/3-540-56402-0_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:03:45Z","timestamp":1605647025000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56402-0_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540564027","9783540475545"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-56402-0_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}