{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T02:46:39Z","timestamp":1778294799681,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540582182","type":"print"},{"value":"9783540485773","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58218-5_16","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:36:42Z","timestamp":1330270602000},"page":"172-182","source":"Crossref","is-referenced-by-count":13,"title":["Sequential and parallel algorithms for embedding problems on classes of partial k-trees"],"prefix":"10.1007","author":[{"given":"Arvind","family":"Gupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naomi","family":"Nishimura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"S. Arnborg, D. Corneil, and A. Proskurowski, \u201cComplexity of finding embeddings in a k-tree,\u201d SIAM Journal of Algebraic and Discrete Methods 8, pp. 277\u2013284, 1987.","journal-title":"SIAM Journal of Algebraic and Discrete Methods"},{"issue":"2","key":"16_CR2","doi-asserted-by":"crossref","first-page":"308ff","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"S. Arnborg, J. Lagergren, and D. Seese, \u201cProblems easy for tree-decomposable graphs,\u201d Journal of Algorithms 12, 2, pp. 308ff, 1991.","journal-title":"Journal of Algorithms"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"H. Bodlaender, \u201cDynamic programming on graphs with bounded treewidth,\u201d Proceedings of the 15th International Colloquium on Automata, Languages and Programming, pp. 105\u2013118.","DOI":"10.1007\/3-540-19488-6_110"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"H. Bodlaender, \u201cA linear time algorithm for finding tree-decompositions of small treewidth,\u201d Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, pp. 226\u2013234, 1993.","DOI":"10.1145\/167088.167161"},{"key":"16_CR5","unstructured":"H. Bodlaender, \u201cNC-algorithms for graphs with bounded tree-width,\u201d Technical Report RUU-CS-88-4, University of Utrecht, 1988."},{"key":"16_CR6","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1016\/0196-6774(90)90013-5","volume":"11","author":"H. Bodlaender","year":"1990","unstructured":"H. Bodlaender, \u201cPolynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-trees,\u201d Journal of Algorithms 11, pp. 631\u2013643, 1990.","journal-title":"Journal of Algorithms"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"J. Bondy, and U.S.R. Murty,Graph Theory with Applications, North-Holland, 1976.","DOI":"10.1007\/978-1-349-03521-2"},{"issue":"2","key":"16_CR8","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321812.321815","volume":"21","author":"R. Brent","year":"1974","unstructured":"R. Brent, \u201cThe parallel evaluation of general arithmetic expressions,\u201d Journal of the ACM 21, 2, pp. 201\u2013206, 1974.","journal-title":"Journal of the ACM"},{"key":"16_CR9","unstructured":"N. Chandrasehkaran and S.T. Hedetniemi, \u201cFast parallel algorithms for tree decomposition and parsing partial k-trees,\u201d Proceedings 26th Annual Allerton Conference on Communication, Control, and Computing, 1988."},{"key":"16_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979."},{"key":"16_CR11","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0166-218X(90)90081-M","volume":"29","author":"P. Gibbons","year":"1990","unstructured":"P. Gibbons, R. Karp, G. Miller, and D. Soroker, \u201cSubtree isomorphism is in random NC,\u201d Discrete Applied Mathematics 29, pp. 35\u201362, 1990.","journal-title":"Discrete Applied Mathematics"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"A. Gupta and N. Nishimura, \u201cThe parallel complexity of tree embedding problems,\u201d to appear in Journal of Algorithms. A preliminary version has appeared in Proceedings of the Ninth Annual Symposium on Theoretical Aspects of Computer Science, pp. 21\u201332, 1992.","DOI":"10.1007\/3-540-55210-3_170"},{"key":"16_CR13","unstructured":"A. Gupta and N. Nishimura, \u201cSequential and parallel algorithms for embedding problems on classes of partial k-trees,\u201d Technical Report CS-93-55, University of Waterloo, December 1993."},{"key":"16_CR14","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1515\/crll.1869.70.185","volume":"70","author":"C. Jordan","year":"1869","unstructured":"C. Jordan, \u201cSur les assemblages de lignes,\u201d Journal Reine Angew. Math. 70, pp.185\u2013190, 1869.","journal-title":"Journal Reine Angew. Math."},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"J. Lagergren, \u201cEfficient parallel algorithms for tree-decompositions and related problems,\u201d Proceedings of the 31st Annual IEEE Symposium on the Foundations of Computer Science, pp. 173\u2013181, 1990.","DOI":"10.1109\/FSCS.1990.89536"},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0304-3975(89)90011-X","volume":"63","author":"A. Lingas","year":"1989","unstructured":"A. Lingas, \u201cSubgraph isomorphism for biconnected outerplanar graphs in cubic time,\u201d Theoretical Computer Science 63, pp. 295\u2013302, 1989.","journal-title":"Theoretical Computer Science"},{"key":"16_CR17","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0020-0190(89)90170-1","volume":"30","author":"A. Lingas","year":"1989","unstructured":"A. Lingas and M. Karpinski, \u201cSubtree isomorphism is NC reducible to bipartite perfect matching,\u201d Information Processing Letters 30 pp. 27\u201332, 1989.","journal-title":"Information Processing Letters"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"A. Lingas and M. M. Syslo, \u201cA polynomial-time algorithm for subgraph isomorphism of two-connected series parallel graphs,\u201d Proceedings of the 15th International Colloquium on Automata, Languages, and Programming pp. 394\u2013409, 1988.","DOI":"10.1007\/3-540-19488-6_130"},{"key":"16_CR19","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0012-365X(92)90687-B","volume":"108","author":"J. Matou\u0161ek","year":"1992","unstructured":"J. Matou\u0161ek and R. Thomas, \u201cOn the complexity of finding iso-and other morphisms for partial k-trees,\u201d Discrete Mathematics 108, pp. 343\u2013364, 1992.","journal-title":"Discrete Mathematics"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"D. Matula, \u201cSubtree isomorphism in O(n5\/2),\u201d Annals of Discrete Mathematics 2, pp. 91\u2013106, North-Holland, 1978.","DOI":"10.1016\/S0167-5060(08)70324-8"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"B. Reed, \u201cFinding approximate separators and computing tree width quickly,\u201d Proceedings of the 24th ACM Symposium on the Theory of Computing, pp. 221\u2013228, 1992.","DOI":"10.1145\/129712.129734"},{"key":"16_CR22","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0012-365X(74)90042-9","volume":"7","author":"D. J. Rose","year":"1974","unstructured":"D.J. Rose, \u201cOn simple characterization of k-trees,\u201d Discrete Mathematics 7, pp. 317\u2013322, 1974.","journal-title":"Discrete Mathematics"},{"key":"16_CR23","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","volume":"36","author":"N. Robertson","year":"1984","unstructured":"N. Robertson and P. Seymour, \u201cGraph Minors III. Planar tree-width,\u201d Journal of Combinatorial Theory (Ser. B) 36, pp. 49\u201364, 1984.","journal-title":"Journal of Combinatorial Theory (Ser. B)"},{"key":"16_CR24","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"N. Robertson and P. Seymour, \u201cGraph Minors II. Algorithm aspects of tree-width,\u201d Journal of Algorithms 7, pp. 309\u2013322, 1986.","journal-title":"Journal of Algorithms"},{"key":"16_CR25","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0304-3975(82)90133-5","volume":"17","author":"M. M. Syslo","year":"1982","unstructured":"M. M. Syslo, \u201cThe subgraph isomorphism problem for outerplanar graphs,\u201d Theoretical Computer Science 17, pp. 91\u201397, 1982.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT '94"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58218-5_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:18:45Z","timestamp":1605647925000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58218-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540582182","9783540485773"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-58218-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]}}}