{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T04:17:30Z","timestamp":1725769050784},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319041254"},{"type":"electronic","value":"9783319041261"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-04126-1_7","type":"book-chapter","created":{"date-parts":[[2014,1,8]],"date-time":"2014-01-08T03:16:13Z","timestamp":1389150973000},"page":"77-88","source":"Crossref","is-referenced-by-count":3,"title":["Search Strategies for Subgraph Isomorphism Algorithms"],"prefix":"10.1007","author":[{"given":"Uro\u0161","family":"\u010cibej","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jurij","family":"Miheli\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"7_CR1","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1021\/ci00047a033","volume":"25","author":"A.T. Balaban","year":"1985","unstructured":"Balaban, A.T.: Applications of graph theory in chemistry. Journal of Chemical Information and Computer Sciences\u00a025(3), 334\u2013343 (1985)","journal-title":"Journal of Chemical Information and Computer Sciences"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Carrington, P.J., Scott, J., Wasserman, S.: Models and methods in social network analysis. Cambridge University Press (2005)","DOI":"10.1017\/CBO9780511811395"},{"issue":"10","key":"7_CR3","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"L.P. Cordella","year":"2004","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Analysis and Machine Intelligence\u00a026(10), 1367\u20131372 (2004)","journal-title":"IEEE Trans. Pattern Analysis and Machine Intelligence"},{"issue":"8","key":"7_CR4","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1016\/S0167-8655(02)00253-2","volume":"24","author":"M. De Santo","year":"2003","unstructured":"De Santo, M., Foggia, P., Sansone, C., Vento, M.: A large database of graphs and its use for benchmarking graph isomorphism algorithms. Pattern Recognition Letters\u00a024(8), 1067\u20131079 (2003)","journal-title":"Pattern Recognition Letters"},{"key":"7_CR5","unstructured":"Foggia, P., Sansone, C.: A performance comparison of five algorithms for graph isomorphism. In: TC-15 Workshop on Graph-based Representations in Pattern Recognition (2001)"},{"key":"7_CR6","unstructured":"Foggia, P., Sansone, C., Vento, M.: A database of graphs for isomorphism and sub-graph isomorphism benchmarking. In: Proc. of the 3rd IAPR TC-15 International Workshop on Graph-based Representations (2001)"},{"key":"7_CR7","unstructured":"Foggia, P., Sansone, C., Vento, M.: A Performance Comparison of Five Algorithm for Graph Isomorphism. In: 3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition (2001)"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-540-85363-3_33","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"M. F\u00fcrer","year":"2008","unstructured":"F\u00fcrer, M., Prasad Kasiviswanathan, S.: Approximately counting embeddings into random graphs. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX and RANDOM 2008. LNCS, vol.\u00a05171, pp. 416\u2013429. Springer, Heidelberg (2008)"},{"issue":"1","key":"7_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0304-3975(96)00046-1","volume":"164","author":"A. Gupta","year":"1996","unstructured":"Gupta, A., Nishimura, N.: The complexity of subgraph isomorphism for classes of partial k-trees. Theoretical Computer Science\u00a0164(1), 287\u2013298 (1996)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"7_CR10","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1097\/WCO.0b013e32833aa567","volume":"23","author":"Y. He","year":"2010","unstructured":"He, Y., Evans, A.: Graph theoretical modeling of brain connectivity. Current Opinion in Neurology\u00a023(4), 341\u2013350 (2010)","journal-title":"Current Opinion in Neurology"},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1162\/089120103321337430","volume":"29","author":"E. Krahmer","year":"2003","unstructured":"Krahmer, E., Van Erk, S., Verleg, A.: Graph-based generation of referring expressions. Computational Linguistics\u00a029(1), 53\u201372 (2003)","journal-title":"Computational Linguistics"},{"issue":"3","key":"7_CR12","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/s10618-009-0132-7","volume":"19","author":"V. Lipets","year":"2009","unstructured":"Lipets, V., Vanetik, N., Gudes, E.: Subsea: an efficient heuristic algorithm for subgraph isomorphism. Data Mining and Knowledge Discovery\u00a019(3), 320\u2013350 (2009)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"7_CR13","unstructured":"Miheli\u010d, J., \u010cibej, U.: Improvements of ullmann\u2019s algorithm for subgraph isomorphism (submitted for publication, 2013)"},{"issue":"12-13","key":"7_CR14","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1016\/j.artint.2010.05.002","volume":"174","author":"C. Solnon","year":"2010","unstructured":"Solnon, C.: All Different-based filtering for subgraph isomorphism. Artificial Intelligence\u00a0174(12-13), 850\u2013864 (2010)","journal-title":"Artificial Intelligence"},{"key":"7_CR15","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. J. Assoc. for Computing Machinery\u00a023, 31\u201342 (1976)","journal-title":"J. Assoc. for Computing Machinery"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Valiente, G.: Algorithms on Trees and Graphs. Springer (2002)","DOI":"10.1007\/978-3-662-04921-1"}],"container-title":["Lecture Notes in Computer Science","Applied Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-04126-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T20:50:14Z","timestamp":1647895814000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-04126-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319041254","9783319041261"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-04126-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}