{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:46Z","timestamp":1725663706754},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540552109"},{"type":"electronic","value":"9783540467755"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55210-3_201","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T09:54:33Z","timestamp":1330250073000},"page":"413-423","source":"Crossref","is-referenced-by-count":3,"title":["A simple linear time algorithm for triangulating three-colored graphs"],"prefix":"10.1007","author":[{"given":"Hans","family":"Bodlaender","sequence":"first","affiliation":[]},{"given":"Ton","family":"Kloks","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"33_CR1","volume-title":"Tech. Rep. RUU-CS-86-22","author":"H.L. Bodlaender","year":"1986","unstructured":"H.L. Bodlaender, Classes of graphs with bounded tree-width, Tech. Rep. RUU-CS-86-22, Department of Computer Science, Utrecht University, Utrecht, 1986."},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"H.L. Bodlaender and T. Kloks, Better algorithms for the pathwidth and treewidth of graphs, Proceedings of the 18th International colloquium on Automata, Languages and Programming, 544\u2013555, Springer Verlag, Lecture Notes in Computer Science, vol. 510 (1991).","DOI":"10.1007\/3-540-54233-7_162"},{"key":"33_CR3","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02992776","volume":"25","author":"G. Dirac","year":"1961","unstructured":"G. Dirac, On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg\n25, 71\u201376 (1961).","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"33_CR4","unstructured":"M.R. Fellows and T. Warnow, Personal communication, 1991."},{"key":"33_CR5","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"D. Fulkerson","year":"1965","unstructured":"D. Fulkerson and O. Gross, Incidence matrices and interval graphs, Pacific J. Math.\n15, 835\u2013855 (1965).","journal-title":"Pacific J. Math."},{"key":"33_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":"33_CR7","doi-asserted-by":"crossref","unstructured":"S. Kannan and T. Warnow, Inferring Evolutionary History from DNA Sequences, in: Proceedings of the 31th Annual Symposium on Foundations of Computer Science, pp. 362\u2013371, 1990.","DOI":"10.1109\/FSCS.1990.89555"},{"key":"33_CR8","unstructured":"S. Kannan and T. Warnow, Triangulating three-colored graphs, in: Proceedings of the 1st Ann. ACM-SIAM Symposium on Discrete Algorithms, pp. 337\u2013343, 1990."},{"key":"33_CR9","unstructured":"T. Kloks, Enumeration of biconnected partial 2-trees, to appear."},{"key":"33_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0196-6774(91)90020-Y","volume":"12","author":"J. Matou\u0161ek","year":"1991","unstructured":"J. Matou\u0161ek and R. Thomas, Algorithms Finding tree-decompositions of graphs, Journal of Algorithms\n12, 1\u201322 (1991).","journal-title":"Journal of Algorithms"},{"key":"33_CR11","unstructured":"C.F. McMorris, T. Warnow, and T. Wimer, Triangulating colored graphs, submitted to Inform. Proc. Letters."},{"key":"33_CR12","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/net.3230130202","volume":"13","author":"J.A. Wald","year":"1983","unstructured":"J.A. Wald and C.J. Colbourn, Steiner trees, partial 2-trees and minimum IFI networks, Networks\n13 (1983), 159\u2013167.","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","STACS 92"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55210-3_201.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:28:24Z","timestamp":1619573304000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55210-3_201"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540552109","9783540467755"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-55210-3_201","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}