{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:36:35Z","timestamp":1725561395568},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206958"},{"type":"electronic","value":"9783540245872"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24587-2_8","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T04:59:19Z","timestamp":1280379559000},"page":"58-67","source":"Crossref","is-referenced-by-count":1,"title":["Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees"],"prefix":"10.1007","author":[{"given":"Atsuko","family":"Yamaguchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Mamitsuka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","first-page":"1488","volume":"E76-A","author":"T. Akutsu","year":"1993","unstructured":"Akutsu, T.: A polynomial time algorithm for finding a largest common subgraph of almost trees of bounded degree. IEICE Trans. Fundamentals\u00a0E76-A, 1488\u20131493 (1993)","journal-title":"IEICE Trans. Fundamentals"},{"key":"8_CR2","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. on Algebraic and Discrete Methods\u00a08, 277\u2013284 (1987)","journal-title":"SIAM J. on Algebraic and Discrete Methods"},{"key":"8_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 on graphs embedded in k-trees. Discrete Appl. Math.\u00a023, 11\u201324 (1989)","journal-title":"Discrete Appl. Math."},{"key":"8_CR4","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-decompositions of small treewidth. SIAM J. Comput.\u00a025, 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"key":"8_CR5","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1021\/ci00010a015","volume":"32","author":"D.M. Bayada","year":"1992","unstructured":"Bayada, D.M., Simpson, R.W., Johnson, A.P.: An algorithm for the multiple common subgraph problem. J. Chem. Inf. Comput. Sci.\u00a032, 680\u2013685 (1992)","journal-title":"J. Chem. Inf. Comput. Sci."},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1002\/net.3230250405","volume":"25","author":"G. Ding","year":"1995","unstructured":"Ding, G.: Graphs with not too many spanning trees. Networks\u00a025, 193\u2013197 (1995)","journal-title":"Networks"},{"key":"8_CR7","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman (1987)"},{"key":"8_CR8","first-page":"402","volume":"30","author":"A. Gupta","year":"2002","unstructured":"Gupta, A., Nishimura, N.: The complexity of subgraph isomorphisms for classes of partial k-trees. Theoret. Comput. Sci.\u00a030, 402\u2013404 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1093\/nar\/30.1.402","volume":"30","author":"S. Goto","year":"2002","unstructured":"Goto, S., Okuno, Y., Hattori, M., Nishioka, T., Kanehisa, M.: LIGAND: database of chemical compounds and reactions in biological pathways. Nucleic Acids Res.\u00a030, 402\u2013404 (2002)","journal-title":"Nucleic Acids Res."},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","first-page":"377","volume-title":"STACS 92","author":"V. Kann","year":"1992","unstructured":"Kann, V.: On the approximability of the maximum common subgraph problem. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol.\u00a0577, pp. 377\u2013388. Springer, Heidelberg (1992)"},{"key":"8_CR11","series-title":"Algorithm and Complexity","volume-title":"Handbook of Theoretical Computer Science","author":"J. Leeuwen van","year":"1990","unstructured":"van Leeuwen, J.: Handbook of Theoretical Computer Science. Algorithm and Complexity, vol.\u00a0A. Elsevier Science Pub., Amsterdam (1990)"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0012-365X(92)90687-B","volume":"108","author":"J. Matou\u0161ek","year":"1992","unstructured":"Matou\u0161ek, J., Thomas, R.: On the complexity of finding iso- and other morphisms for partial k-trees. Discrete Math.\u00a0108, 343\u2013364 (1992)","journal-title":"Discrete Math."},{"key":"8_CR13","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0012-365X(92)90687-B","volume":"108","author":"D. Sanders","year":"1992","unstructured":"Sanders, D.: On linear recognition of tree-width at most four. SIAM J. Discrete Math.\u00a0108, 343\u2013364 (1992)","journal-title":"SIAM J. Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24587-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T11:01:35Z","timestamp":1552820495000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24587-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206958","9783540245872"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24587-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}