{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T15:59:47Z","timestamp":1725465587270},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540646822"},{"type":"electronic","value":"9783540691068"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054370","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T07:43:28Z","timestamp":1149666208000},"page":"222-233","source":"Crossref","is-referenced-by-count":1,"title":["Memory requirements for table computations in partial k-tree algorithms"],"prefix":"10.1007","author":[{"given":"Bengt","family":"Aspvall","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Proskurowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan Arne","family":"Telle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,26]]},"reference":[{"key":"21_CR1","unstructured":"B.Aspvall, A.Proskurowski and J.A.Telle, Memory requirements for table computations in partial k-tree algorithms, submitted special issue of Algorithmica on Treewidth, Graph Minors and Algorithms."},{"key":"21_CR2","first-page":"121","volume":"32","author":"T. Beyer","year":"1981","unstructured":"T. Beyer, S.M. Hedetniemi, S.T. Hedetniemi and A. Proskurowski, Graph traversal with minimum stack depth, Congressus Numerantium, Vol. 32, 121\u2013130, 1981.","journal-title":"Congressus Numerantium"},{"key":"21_CR3","unstructured":"H. Bodlaender, J. Gustedt and J.A. Telle, Linear-time register allocation for a fixed number of registers and no stack variables, Proceedings 9th ACM-SIAM Symposium on Discrete Algorithms (SODA'98), 574\u2013583."},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"H. Bodlaender, A linear time algorithm for finding tree-decompositions of small treewidth, in Proceedings 25th Symposium on the Theory of Computing (STOC'93), 226\u2013234.","DOI":"10.1145\/167088.167161"},{"key":"21_CR5","first-page":"1","volume":"11","author":"H. Bodlaender","year":"1993","unstructured":"H. Bodlaender, A tourist guide through treewidth, Acta Cybernetica, 11:1\u201321, 1993.","journal-title":"Acta Cybernetica"},{"key":"21_CR6","unstructured":"Y.-J. Chiang, M.T. Goodrich, E.F. Grove, R. Tamassia, D.E. Vengroff and J.S.Vitter, External-Memory Graph Algorithms, Proc. ACM-SIAM Symp. on Discrete Algorithms (SODA'95), pp. 139\u2013149, 1995."},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1006\/inco.1994.1064","volume":"113","author":"J.A. Ellis","year":"1994","unstructured":"J.A. Ellis, I.H. Sudborough and J.S. Turner, The vertex separation number and search number of a graph, Information and Computation vol. 113, 50\u201379, 1994.","journal-title":"Information and Computation"},{"key":"21_CR8","unstructured":"B. Hiim, Implementing and testing algorithms for tree-like graphs, Master's Thesis, November 1997, Dept. of Informatics, University of Bergen."},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0304-3975(86)90146-5","volume":"47","author":"L. Kirousis","year":"1986","unstructured":"L. Kirousis and C. Papadimitriou, Searching and pebbling, Theoretical Computer Science 47, 205\u2013218, 1986.","journal-title":"Theoretical Computer Science"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"R. M\u00f6hring, Graph problems related to gate matrix layout and PLA folding, in Computational Graph Theory, Computing Suppl. 7, Springer-Verlag, 17\u201351, 1990.","DOI":"10.1007\/978-3-7091-9076-0_2"},{"key":"21_CR11","volume-title":"Technical Report 392\/1994","author":"A. Parra","year":"1994","unstructured":"A. Parra, Triangulating multitolerance graphs, Technical Report 392\/1994, TU Berlin, Germany, 1994."},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","volume":"35","author":"N. Robertson","year":"1983","unstructured":"N. Robertson and P. Seymour, Graph Minors I. Excluding a forest, Journal of Combinatorial Theory Series B 35, 39\u201361, 1983.","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"P. Scheffler, A linear algorithm for the pathwidth of trees, Topics in Combinatorics and Graph Theory, Physica-Verlag Heidelberg, 613\u2013620, 1990.","DOI":"10.1007\/978-3-642-46908-4_70"},{"issue":"No.4","key":"21_CR14","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1137\/S0895480194275825","volume":"10","author":"J.A. Telle","year":"1997","unstructured":"J.A. Telle and A. Proskurowski, Algorithms for vertex partitioning problems on partial k-trees, SIAM Journal on Discrete Mathematics, Vol. 10, No. 4, 529\u2013550, November 1997.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"M. Thorup, Structured Programs have Small Tree-Width and Good Register Allocation, Proceedings 23rd Workshop on Graph-Theoretical Concepts in Computer Science (WG'97), LNCS vol. 1335, 318\u2013332.","DOI":"10.1007\/BFb0024507"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT'98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054370","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T06:46:46Z","timestamp":1555656406000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0054370"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540646822","9783540691068"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0054370","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}