{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:48:34Z","timestamp":1770994114570,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540549451","type":"print"},{"value":"9783540466000","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54945-5_49","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:20:25Z","timestamp":1330194025000},"page":"52-60","source":"Crossref","is-referenced-by-count":22,"title":["Substitution decomposition on chordal graphs and applications"],"prefix":"10.1007","author":[{"given":"Wen-Lian","family":"Hsu","sequence":"first","affiliation":[]},{"given":"Tze-Heng","family":"Ma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K. S. Booth","year":"1976","unstructured":"K. S. Booth and G. S. Lueker, \u201cTesting for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-tree Algorithms,\u201d J. Comput. Syst. Sci., v. 13, 1976, pp. 335\u2013379.","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"D. Coppersmith and S. Winograd, \u201cMatrix Multiplication via Arithmetic Progressions,\u201d Proceedings of the 19th Annual Symposium on the Theory of Computation, 1987, pp. 1\u20136.","DOI":"10.1145\/28395.28396"},{"key":"8_CR3","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1090\/S0002-9939-1982-0660592-3","volume":"85","author":"D. Duffus","year":"1982","unstructured":"D. Duffus, I. Rival, and P. Winkler, \u201cMinimizing Setups for Cycle-free Ordered Sets,\u201d Proc. of the American Math. Soc., v. 85, 1982, pp. 509\u2013513.","journal-title":"Proc. of the American Math. Soc."},{"key":"8_CR4","volume-title":"Interval Orders and Interval Graphs","author":"P. C. Fishburn","year":"1985","unstructured":"P. C. Fishburn, Interval Orders and Interval Graphs, Wiley, New York, 1985."},{"key":"8_CR5","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","volume":"16","author":"F. Gavril","year":"1974","unstructured":"F. Gavril, \u201cThe Intersection Graphs of Subtrees in Trees are Exactly the Chordal Graphs,\u201d J. Combin. Theory B, v. 16, 1974, pp. 47\u201356.","journal-title":"J. Combin. Theory B"},{"key":"8_CR6","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M. C. Golumbic","year":"1980","unstructured":"M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980."},{"key":"8_CR7","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1137\/0218005","volume":"18","author":"N. Korte","year":"1989","unstructured":"N. Korte and R. H. M\u00f6hring, \u201cAn Incremental Linear-Time Algorithm for Recognizing Interval Graphs,\u201d SIAM J. Computing, v. 18, 1989, pp. 68\u201381.","journal-title":"SIAM J. Computing"},{"key":"8_CR8","unstructured":"W. L. Hsu, The Recognition and Isomorphism Problems for Circular-arc Graphs, preprint, 1989."},{"key":"8_CR9","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4064\/fm-51-1-45-64","volume":"51","author":"C. G. Lekkerkerker","year":"1962","unstructured":"C. G. Lekkerkerker and J. Boland, \u201cRepresentation of a Finite Graph by a Set of Intervals on the Real Line,\u201d Fund. Math., v. 51, 1962, pp. 45\u201364.","journal-title":"Fund. Math."},{"key":"8_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/58562.59300","volume":"36","author":"J. H. Muller","year":"1989","unstructured":"J. H. Muller and J. Spinrad, \u201cIncremental Modular Decomposition,\u201d Journal of the ACM, v. 36, 1989, pp. 1\u201319.","journal-title":"Journal of the ACM"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"T. H. Ma and J. Spinrad, \u201cCycle-free Partial Orders and Chordal Comparability Graphs,\u201d Order, to appear.","DOI":"10.1007\/BF00385814"},{"key":"8_CR12","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D. J. Rose","year":"1976","unstructured":"D. J. Rose, R. E. Tarjan, and G. S. Lueker, \u201cAlgorithmic Aspects of Vertex Elimination of Graphs,\u201d SIAM J. Comput., v. 5, 1976, pp. 266\u2013283.","journal-title":"SIAM J. Comput."},{"key":"8_CR13","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1137\/0214048","volume":"14","author":"J. Spinrad","year":"1985","unstructured":"J. Spinrad, \u201cOn Comparability and Permutation Graphs,\u201d SIAM J. Comput., v. 14, 1985, pp. 658\u2013670.","journal-title":"SIAM J. Comput."},{"key":"8_CR14","unstructured":"J. Spinrad, \u201cP4 Trees and Substitution Decomposition,\u201d Discrete Applied Math., to appear, 1989."},{"key":"8_CR15","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0606031","volume":"6","author":"R. E. Tarjan","year":"1985","unstructured":"R. E. Tarjan, \u201cAmortized Computational Complexity,\u201d SIAM J. Alg. Disc. Meth., v. 6, 1985, pp. 306\u2013318.","journal-title":"SIAM J. Alg. Disc. Meth."}],"container-title":["Lecture Notes in Computer Science","ISA'91 Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54945-5_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:26:35Z","timestamp":1619558795000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54945-5_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540549451","9783540466000"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-54945-5_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991]]}}}