{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:57:21Z","timestamp":1743123441704,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":16,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_431","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:37:39Z","timestamp":1214505459000},"page":"968-970","source":"Crossref","is-referenced-by-count":0,"title":["Treewidth of Graphs"],"prefix":"10.1007","author":[{"given":"Hans L.","family":"Bodlaender","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"431_CR1_431","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J.\u00a0Algebr. Discret. Methods 8, 277\u2013284 (1987)","journal-title":"SIAM J. Algebr. Discret. Methods"},{"key":"431_CR2_431","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1137\/0607033","volume":"7","author":"S. Arnborg","year":"1986","unstructured":"Arnborg, S., Proskurowski, A.: Characterization and recognition of partial 3-trees. SIAM J.\u00a0Algebr. Discret. Methods 7, 305\u2013314 (1986)","journal-title":"SIAM J. Algebr. Discret. Methods"},{"key":"431_CR3_431","first-page":"1","volume":"11","author":"H.L. Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernetica 11, 1\u201323 (1993)","journal-title":"Acta Cybernetica"},{"key":"431_CR4_431","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear time algorithm for finding tree\u2010decompositions of small treewidth. SIAM J.\u00a0Comput. 25, 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"key":"431_CR5_431","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H.L. Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theor. Comp. Sci. 209, 1\u201345 (1998)","journal-title":"Theor. Comp. Sci."},{"key":"431_CR6_431","unstructured":"Bodlaender, H.L.: Discovering treewidth. In: P.\u00a0Vojt\u00e1s\u0306, M.\u00a0Bielikov\u00e1, B.\u00a0Charron-Bost (eds.) Proceedings 31st Conference on Current Trends in Theory and Practive of Computer Science, SOFSEM 2005. Lecture Notes in Computer Science, vol.\u00a03381, pp. 1\u201316. Springer, Berlin (2005)"},{"key":"431_CR7_431","first-page":"1","volume-title":"Proceedings 32nd International Workshop on Graph\u2010Theoretic Concepts in Computer Science WG'06. Lecture Notes in Computer Science, vol. 4271","author":"H.L. Bodlaender","year":"2006","unstructured":"Bodlaender, H.L.: Treewidth: Characterizations, applications, and computations. In: Fomin, F.V. (ed.) Proceedings 32nd International Workshop on Graph\u2010Theoretic Concepts in Computer Science WG'06. Lecture Notes in Computer Science, vol.\u00a04271, pp.\u00a01\u201314. Springer, Berlin (2006)"},{"key":"431_CR8_431","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0304-3975(01)00007-X","volume":"276","author":"V. Bouchitt\u00e9","year":"2002","unstructured":"Bouchitt\u00e9, V., Todinca, I.: Listing all potential maximal cliques of a graph. Theor. Comput. Sci. 276, 17\u201332 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"431_CR9_431","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Kratsch, D., Todinca, I., Villanger, I.: Exact (exponential) algorithms for treewidth and minimum fill-in (2006). To appear in SIAM Journal of Computing, Preliminary version appeared in ICALP 2004","DOI":"10.1007\/978-3-540-27836-8_49"},{"key":"431_CR10_431","first-page":"54","volume-title":"Electronic Notes in Discrete Mathematics, vol. 8","author":"A.M.C.A. Koster","year":"2001","unstructured":"Koster, A.M.C.A., Bodlaender, H.L., van Hoesel, S.P.M.: Treewidth: Computational experiments. In: Broersma, H., Faigle, U., Hurink, J., Pickl, S. (eds.) Electronic Notes in Discrete Mathematics, vol.\u00a08, pp. 54\u201357. Elsevier, Amsterdam (2001)"},{"key":"431_CR11_431","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1111\/j.2517-6161.1988.tb01721.x","volume":"50","author":"S.J. Lauritzen","year":"1988","unstructured":"Lauritzen, S.J., Spiegelhalter, D.J.: Local computations with probabilities on graphical structures and their application to expert systems. J.\u00a0Royal Stat. Soc. Ser. B (Methodological) 50, 157\u2013224 (1988)","journal-title":"J. Royal Stat. Soc. Ser. B (Methodological)"},{"key":"431_CR12_431","doi-asserted-by":"crossref","unstructured":"Reed, B.A.: Tree width and tangles, a new measure of connectivity and some applications, LMS Lecture Note Series, vol.\u00a0241, pp. 87\u2013162. Cambridge University Press, Cambridge (1997)","DOI":"10.1017\/CBO9780511662119.006"},{"key":"431_CR13_431","volume-title":"Algorithmic aspects of tree width, pp. 85\u2013107. CMS Books Math. Ouvrages Math. SMC, 11","author":"B.A. Reed","year":"2003","unstructured":"Reed, B.A.: Algorithmic aspects of tree width, pp. 85\u2013107. CMS Books Math. Ouvrages Math. SMC, 11. Springer, New York (2003)"},{"key":"431_CR14_431","unstructured":"R\u00f6hrig, H.: Tree decomposition: A feasibility study. Master's thesis, Max-Planck\u2010Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany (1998)"},{"key":"431_CR15_431","first-page":"185","volume-title":"Proc. National Conference on Artificial Intelligence (AAAI '97)","author":"K. Shoikhet","year":"1997","unstructured":"Shoikhet, K., Geiger, D.: A practical algorithm for finding optimal triangulations. In: Proc. National Conference on Artificial Intelligence (AAAI '97), pp. 185\u2013190. Morgan Kaufmann, San Fransisco (1997)"},{"key":"431_CR16_431","unstructured":"Bodlaender, H.L.: Treewidthlib. http:\/\/www.cs.uu.nl\/people\/hansb\/treewidthlib (2004)"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_431","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T21:32:49Z","timestamp":1738272769000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_431"}},"subtitle":["1987; Arnborg, Corneil, Proskurowski"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_431","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}