{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:05:05Z","timestamp":1725505505184},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540785811"},{"type":"electronic","value":"9783540785828"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78582-8_72","type":"book-chapter","created":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T20:15:40Z","timestamp":1207080940000},"page":"713-722","source":"Crossref","is-referenced-by-count":2,"title":["A Note on Root Choice for Parallel Processing of Tree Decompositions"],"prefix":"10.1007","author":[{"given":"Yueping","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunting","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"72_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/BF01934985","volume":"25","author":"S. Arnborg","year":"1985","unstructured":"Arnborg, S.: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - A survey. BIT\u00a025, 2\u201323 (1985)","journal-title":"BIT"},{"key":"72_CR2","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J.: Easy problems for tree-decomposable graphs. Journal of Algorithms\u00a012, 308\u2013349 (1991)","journal-title":"Journal of Algorithms"},{"key":"72_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","volume":"23","author":"S. Arnborg","year":"1989","unstructured":"Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial k-trees. Disc. Appl. Math.\u00a023, 11\u201324 (1989)","journal-title":"Disc. Appl. Math."},{"key":"72_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11917496_1","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"H.L. Bodlaender","year":"2006","unstructured":"Bodlaender, H.L.: Treewidth: Characterizations, Applications, and Computations. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol.\u00a04271, pp. 1\u201314. Springer, Heidelberg (2006)"},{"unstructured":"Borie, R.B.: Recursively Constructed Graph Families. PhD thesis, School of Information and Computer Science, Georgia Institute of Technology (1988)","key":"72_CR5"},{"key":"72_CR6","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/BF01758777","volume":"7","author":"R.B. Borie","year":"1992","unstructured":"Borie, R.B., Parker, R.G., Tovey, C.A.: Automatic generation of lineartime algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica\u00a07, 555\u2013581 (1992)","journal-title":"Algorithmica"},{"key":"72_CR7","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1287\/opre.9.6.841","volume":"9","author":"T.C. Hu","year":"1961","unstructured":"Hu, T.C.: Parallel sequencing and assembly line problems. Operations Research\u00a09, 841\u2013848 (1961)","journal-title":"Operations Research"},{"key":"72_CR8","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. The Journal of the Royal Statistical Society Series B (Methodological)\u00a050, 157\u2013224 (1988)","journal-title":"The Journal of the Royal Statistical Society Series B (Methodological)"},{"key":"72_CR9","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors (II) Algorithmic aspects of tree-width. J. Algorithms\u00a07, 309\u2013322 (1986)","journal-title":"J. Algorithms"},{"key":"72_CR10","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/inco.1997.2697","volume":"142","author":"M. Thorup","year":"1998","unstructured":"Thorup, M.: Structured programs have small tree-width and good register allocation. Information and Computation\u00a0142, 159\u2013181 (1998)","journal-title":"Information and Computation"},{"unstructured":"Wimer, T.V.: Linear Algorithms on k-Terminal Graphs. PhD thesis, Dept. of Computer Science, Clemson University (1987)","key":"72_CR11"},{"key":"72_CR12","first-page":"43","volume":"50","author":"T.V. Wimer","year":"1985","unstructured":"Wimer, T.V., Hedetniemi, S.T., Laskar, R.: A methodology for constructing linear graph algorithms. Congressus Numerantium\u00a050, 43\u201360 (1985)","journal-title":"Congressus Numerantium"},{"key":"72_CR13","volume-title":"Fiber network service survivability","author":"T.H. Wu","year":"1992","unstructured":"Wu, T.H.: Fiber network service survivability. Artech House, Inc., Norwood (1992)"},{"key":"72_CR14","first-page":"376","volume":"14","author":"A. Yamaguchi","year":"2003","unstructured":"Yamaguchi, A., Aoki, K.F., Mamitsuka, H.: Graph complexity of chemical compounds in biological pathways. Genome Informatics\u00a014, 376\u2013377 (2003)","journal-title":"Genome Informatics"}],"container-title":["Lecture Notes in Computer Science","Agent and Multi-Agent Systems: Technologies and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78582-8_72.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:14:19Z","timestamp":1619522059000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78582-8_72"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540785811","9783540785828"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78582-8_72","relation":{},"subject":[]}}