{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:47:18Z","timestamp":1759063638288,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319947754"},{"type":"electronic","value":"9783319947761"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-94776-1_28","type":"book-chapter","created":{"date-parts":[[2018,6,29]],"date-time":"2018-06-29T01:48:06Z","timestamp":1530236886000},"page":"328-340","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search"],"prefix":"10.1007","author":[{"given":"Alessio","family":"Conte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Grossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Marino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Versari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,29]]},"reference":[{"issue":"1","key":"28_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D Avis","year":"1996","unstructured":"Avis, D., Fukuda, K.: Reverse search for enumeration. Discret. Appl. Math. 65(1), 21\u201346 (1996)","journal-title":"Discret. Appl. Math."},{"issue":"9","key":"28_CR2","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Finding all cliques of an undirected graph (algorithm 457). Commun. ACM 16(9), 575\u2013576 (1973)","journal-title":"Commun. ACM"},{"issue":"13","key":"28_CR3","doi-asserted-by":"publisher","first-page":"i366","DOI":"10.1093\/bioinformatics\/btn186","volume":"24","author":"Y Cao","year":"2008","unstructured":"Cao, Y., Jiang, T., Girke, T.: A maximum common substructure-based algorithm for searching and predicting drug-like compounds. Bioinformatics 24(13), i366\u2013i374 (2008)","journal-title":"Bioinformatics"},{"issue":"7","key":"28_CR4","doi-asserted-by":"publisher","first-page":"1147","DOI":"10.1016\/j.jcss.2008.04.003","volume":"74","author":"S Cohen","year":"2008","unstructured":"Cohen, S., Kimelfeld, B., Sagiv, Y.: Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties. J. Comput. Syst. Sci. 74(7), 1147\u20131159 (2008)","journal-title":"J. Comput. Syst. Sci."},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-319-58163-7_4","volume-title":"Algorithms for Computational Biology","author":"A Conte","year":"2017","unstructured":"Conte, A., Grossi, R., Marino, A., Tattini, L., Versari, L.: A fast algorithm for large common connected induced subgraphs. In: Figueiredo, D., Mart\u00edn-Vide, C., Pratas, D., Vega-Rodr\u00edguez, M.A. (eds.) AlCoB 2017. LNCS, vol. 10252, pp. 62\u201374. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-58163-7_4"},{"key":"28_CR6","unstructured":"Conte, A., Grossi, R., Marino, A., Versari, L.: Sublinear-space bounded-delay enumeration for massive network analytics: maximal cliques. In: ICALP, pp. 148:1\u2013148:15 (2016)"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Conte, A., Grossi, R., Marino, A., Versari, L.: Listing Maximal Subgraphs in Strongly Accessible Set Systems, March 2018. arXiv e-prints arXiv:1803.03659","DOI":"10.1137\/17M1152206"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-319-13075-0_7","volume-title":"Algorithms and Computation","author":"A Droschinsky","year":"2014","unstructured":"Droschinsky, A., Heinemann, B., Kriege, N., Mutzel, P.: Enumeration of maximum common subtree isomorphisms with polynomial-delay. In: Ahn, H.-K., Shin, C.-S. (eds.) ISAAC 2014. LNCS, vol. 8889, pp. 81\u201393. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13075-0_7"},{"issue":"1","key":"28_CR9","first-page":"68","volume":"1","author":"HC Ehrlich","year":"2011","unstructured":"Ehrlich, H.C., Rarey, M.: Maximum common subgraph isomorphism algorithms and their applications in molecular science: a review. Wiley Interdiscip. Rev.: Comput. Mol. Sci. 1(1), 68\u201379 (2011)","journal-title":"Wiley Interdiscip. Rev.: Comput. Mol. Sci."},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S1093-3263(97)00089-2","volume":"15","author":"EJ Gardiner","year":"1997","unstructured":"Gardiner, E.J., Artymiuk, P.J., Willett, P.: Clique-detection algorithms for matching 3-dimensional molecular structures. J. Mol. Graph. Model. 15, 245\u2013253 (1997)","journal-title":"J. Mol. Graph. Model."},{"issue":"2","key":"28_CR11","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/PL00009212","volume":"21","author":"A Gupta","year":"1998","unstructured":"Gupta, A., Nishimura, N.: Finding largest subtrees and smallest supertrees. Algorithmica 21(2), 183\u2013210 (1998)","journal-title":"Algorithmica"},{"issue":"Suppl 4","key":"28_CR12","doi-asserted-by":"publisher","first-page":"S6","DOI":"10.1186\/1471-2105-7-S4-S6","volume":"7","author":"X Huang","year":"2006","unstructured":"Huang, X., Lai, J., Jennings, S.: Maximum common subgraph: some upper bound and lower bound results. BMC Bioinform. 7(Suppl 4), S6 (2006)","journal-title":"BMC Bioinform."},{"issue":"1","key":"28_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(00)00286-3","volume":"250","author":"I Koch","year":"2001","unstructured":"Koch, I.: Enumerating all connected maximal common subgraphs in two graphs. Theor. Comp. Sci. 250(1), 1\u201330 (2001)","journal-title":"Theor. Comp. Sci."},{"issue":"2","key":"28_CR14","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1089\/cmb.1996.3.289","volume":"3","author":"I Koch","year":"1996","unstructured":"Koch, I., Lengauer, T., Wanke, E.: An algorithm for finding maximal common subtopologies in a set of protein structures. J. Comput. Biol. 3(2), 289\u2013306 (1996)","journal-title":"J. Comput. Biol."},{"issue":"6","key":"28_CR15","first-page":"591","volume":"34","author":"EB Krissinel","year":"2004","unstructured":"Krissinel, E.B., Henrick, K.: Common subgraph isomorphism detection by backtracking search. Softw.: Pract. Exp. 34(6), 591\u2013607 (2004)","journal-title":"Softw.: Pract. Exp."},{"issue":"3","key":"28_CR16","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1137\/0209042","volume":"9","author":"EL Lawler","year":"1980","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Generating all maximal independent sets: NP-hardness andpolynomial-time algorithms. SIAM J. Comput. 9(3), 558\u2013565 (1980)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"28_CR17","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF02575586","volume":"9","author":"G Levi","year":"1973","unstructured":"Levi, G.: A note on the derivation of maximal common subgraphs of two directed or undirected graphs. CALCOLO 9(4), 341\u2013352 (1973)","journal-title":"CALCOLO"},{"key":"28_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-540-27810-8_23","volume-title":"Algorithm Theory - SWAT 2004","author":"K Makino","year":"2004","unstructured":"Makino, K., Uno, T.: New algorithms for enumerating all maximal cliques. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 260\u2013272. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27810-8_23"},{"key":"28_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/11533719_73","volume-title":"Computing and Combinatorics","author":"WH Suters","year":"2005","unstructured":"Suters, W.H., Abu-Khzam, F.N., Zhang, Y., Symons, C.T., Samatova, N.F., Langston, M.A.: A new approach and faster exact methods for the maximum common subgraph problem. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 717\u2013727. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11533719_73"},{"key":"28_CR20","unstructured":"Uno, T.: Two general methods to reduce delay and change of enumerationalgorithms. NII Technical report NII-2003-004E, Tokyo, Japan (2003)"},{"issue":"4","key":"28_CR21","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1504\/IJBRA.2013.054688","volume":"9","author":"RJP Van Berlo","year":"2013","unstructured":"Van Berlo, R.J.P., Winterbach, W., De Groot, M.J.L., Bender, A., Verheijen, P.J.T., Reinders, M.J.T., de Ridder, D.: Efficient calculation of compound similarity based on maximum common subgraphs and its application to prediction of gene transcript levels. Int. J. Bioinform. Res. Appl. 9(4), 407\u2013432 (2013)","journal-title":"Int. J. Bioinform. Res. Appl."},{"key":"28_CR22","unstructured":"Welling, R.: A performance analysis on maximal common subgraph algorithms. In: 15th Twente Student Conference on IT. University of Twente, The Netherlands (2011)"},{"issue":"2","key":"28_CR23","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s00778-014-0373-y","volume":"24","author":"Y Yuan","year":"2015","unstructured":"Yuan, Y., Wang, G., Chen, L., Wang, H.: Graph similarity search on large uncertain graph databases. VLDB J. 24(2), 271\u2013296 (2015)","journal-title":"VLDB J."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94776-1_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:35:34Z","timestamp":1710347734000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94776-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319947754","9783319947761"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94776-1_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"29 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Qing Dao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon2018.sdu.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}