{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:12:11Z","timestamp":1725505931017},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540785675"},{"type":"electronic","value":"9783540785682"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78568-2_34","type":"book-chapter","created":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T17:55:41Z","timestamp":1207072541000},"page":"452-460","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination"],"prefix":"10.1007","author":[{"given":"Yanghua","family":"Xiao","sequence":"first","affiliation":[]},{"given":"Wentao","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Zhenying","family":"He","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"20","key":"34_CR1","doi-asserted-by":"publisher","first-page":"11394","DOI":"10.1073\/pnas.1534710100","volume":"100","author":"R.B. Kelley","year":"2003","unstructured":"Kelley, R.B., et al.: Conserved pathways within bacteria and yeast as revealed by global protein network alignment. PNAS\u00a0100(20), 11394\u201311399 (2003)","journal-title":"PNAS"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Sharan, R., et al.: Identification of protein complexes by comparative analysis of yeast and bacterial protein interaction data. In: RECOMB 2004, pp. 282\u2013289 (2004)","DOI":"10.1145\/974614.974652"},{"key":"34_CR3","volume-title":"Computers and Intractability. A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"2003","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-completeness. W.H. Freeman and Company, New York (2003)"},{"key":"34_CR4","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N. Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XIII: The disjoint paths problem. Journal of Combinatorial Theory\u00a063, 65\u2013110 (1995)","journal-title":"Journal of Combinatorial Theory"},{"issue":"1","key":"34_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.10099","volume":"43","author":"V. IIIya","year":"2004","unstructured":"IIIya, V.: Hicks:Branch Decompositions and Minor Containment. Networks\u00a043(1), 1\u20139 (2004)","journal-title":"Networks"},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"J.R. Ullmann","year":"1976","unstructured":"Ullmann, J.R.: An Algorithm for Subgraph Isomorphism. Journal of the ACM\u00a023, 31\u201342 (1976)","journal-title":"Journal of the ACM"},{"key":"34_CR7","volume-title":"Graph Theory","author":"R. Diestel","year":"2000","unstructured":"Diestel, R.: Graph Theory. Springer, Heidelberg (2000)"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Jin, R., Wang, C., Polshakov, D., Parthasarathy, S., Agrawal, G.: Discovering frequent topological structures from graph datasets. In: KDD 2005, Chicago,USA, pp. 606\u2013611 (2005)","DOI":"10.1145\/1081870.1081944"},{"key":"34_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-09438-9","volume-title":"Principles of Artificial Intelligence","author":"N.J. Nilsson","year":"1982","unstructured":"Nilsson, N.J.: Principles of Artificial Intelligence. Springer, Heidelberg (1982)"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On random graphs. Publicationes Mathematicae, 290\u2013297 (1959)","DOI":"10.5486\/PMD.1959.6.3-4.12"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78568-2_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T11:20:00Z","timestamp":1684322400000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78568-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540785675","9783540785682"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78568-2_34","relation":{},"subject":[]}}