{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T23:00:33Z","timestamp":1773615633756,"version":"3.50.1"},"reference-count":13,"publisher":"Allerton Press","issue":"7","license":[{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Aut. Control Comp. Sci."],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.3103\/s0146411624700287","type":"journal-article","created":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T14:48:45Z","timestamp":1739371725000},"page":"827-835","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem"],"prefix":"10.3103","volume":"58","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7882-8906","authenticated-orcid":false,"given":"V. V.","family":"Vasilchikov","sequence":"first","affiliation":[]}],"member":"1627","published-online":{"date-parts":[[2025,2,12]]},"reference":[{"key":"7749_CR1","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1137\/1024022","volume":"24","author":"M.R. Garey","year":"1982","unstructured":"Garey, M.R. and Johnson, D.S., Computers and intractability: A guide to the theory of NP-completeness, SIAM Rev., 1982, vol. 24, no. 1, pp. 90\u201391.","journal-title":"SIAM Rev."},{"key":"7749_CR2","doi-asserted-by":"publisher","unstructured":"Hoffmann, R., McCreesh, C., and Reilly, C., Between subgraph isomorphism and maximum common subgraph, Proc. AAAI Conf. Artif. Intell., 2017, vol. 31, pp. 3907\u20133914. https:\/\/doi.org\/10.1609\/aaai.v31i1.11137","DOI":"10.1609\/aaai.v31i1.11137"},{"key":"7749_CR3","doi-asserted-by":"publisher","unstructured":"Ndiaye, S.N. and Solnon, Ch., CP models for maximum common subgraph problems, Principles and Practice of Constraint Programming\u2013CP 2011, Lee, J., Ed., Lecture Notes in Computer Science, vol. 6876, Berlin: Springer, 2011, pp. 637\u2013644. https:\/\/doi.org\/10.1007\/978-3-642-23786-7_48","DOI":"10.1007\/978-3-642-23786-7_48"},{"key":"7749_CR4","doi-asserted-by":"publisher","first-page":"99","DOI":"10.7155\/jgaa.00139","volume":"11","author":"D. Conte","year":"2007","unstructured":"Conte, D., Foggia, P., and Vento, M., Challenging complexity of maximum common subgraph detection algorithms: A performance analysis of three algorithms on a wide database of graphs, J. Graph Algorithms Appl., 2007, vol. 11, no. 1, pp. 99\u2013143. https:\/\/doi.org\/10.7155\/jgaa.00139","journal-title":"J. Graph Algorithms Appl."},{"key":"7749_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/spe.4380120103","volume":"12","author":"J.J. McGregor","year":"1982","unstructured":"McGregor, J.J., Backtrack search algorithms and the maximal common subgraph problem, Software: Pract. Exper., 1982, vol. 12, no. 1, pp. 23\u201334. https:\/\/doi.org\/10.1002\/spe.4380120103","journal-title":"Software: Pract. Exper."},{"key":"7749_CR6","volume-title":"An improved algorithm for matching large graphs, Proc. of the 3rd IAPR-TC-15 Int.","author":"L.P. Cordella","year":"2001","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., and Vento, M., An improved algorithm for matching large graphs, Proc. of the 3rd IAPR-TC-15 Int. \n               Workshop on Graph-based Representations, 2001, pp. 149\u2013159. https:\/\/citeseerx.ist.psu.edu\/document?repid=rep1&type=pdf&doi=f3e10bd7521ec6263a58fdaa4369dfe8ad50888c."},{"key":"7749_CR7","first-page":"1","volume":"2","author":"P.J. Durand","year":"1999","unstructured":"Durand, P.J., Pasari, R., Baker, J.W., and Tsai, C.-C., An efficient algorithm for similarity analysis of molecules, Internet J. Chem., 1999, vol. 2, no. 17, pp. 1\u201316.","journal-title":"Internet J. Chem."},{"key":"7749_CR8","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C. Bron","year":"1973","unstructured":"Bron, C. and Kerbosch, J., Algorithm 457: Finding all cliques of an undirected graph, Commun. ACM, 1973, vol.\u00a016, no. 9, pp. 575\u2013577. https:\/\/doi.org\/10.1145\/362342.362367","journal-title":"Commun. ACM"},{"key":"7749_CR9","doi-asserted-by":"crossref","unstructured":"Quer, S., Marcelli, A., and Squillero, G., The maximum common subgraph problem: A parallel and multi-engine approach, Computation, 2020, vol. 8, no. 2, p. 48.","DOI":"10.3390\/computation8020048"},{"key":"7749_CR10","doi-asserted-by":"publisher","first-page":"617","DOI":"10.3103\/S0146411621070166","volume":"55","author":"V.V. Vasilchikov","year":"2021","unstructured":"Vasilchikov, V.V., Parallel algorithm for solving the graph isomorphism problem, Autom. Control Comput. Sci., 2021, vol. 55, no. 7, pp. 617\u2013622. https:\/\/doi.org\/10.3103\/S0146411621070166","journal-title":"Autom. Control Comput. Sci."},{"key":"7749_CR11","doi-asserted-by":"publisher","first-page":"672","DOI":"10.3103\/S0146411623070155","volume":"57","author":"V.V. Vasilchikov","year":"2023","unstructured":"Vasilchikov, V.V., Recursive-parallel algorithm for solving the graph-subgraph isomorphism problem, Autom. Control Comput. Sci., 2023, vol. 57, no. 7, pp. 672\u2013682. https:\/\/doi.org\/10.3103\/S0146411623070155","journal-title":"Autom. Control Comput. Sci."},{"key":"7749_CR12","unstructured":"Vasilchikov, V.V., Sredstva parallel\u2019nogo programmirovaniya dlya vychislitel\u2019nykh sistem s dinamicheskoi balansirovkoi zagruzki (Parallel Programming Tools for Dynamic Load Balancing Computing Systems), Yaroslavl: Yaroslavskii Gos. Univ. im. P.G. Demidova, 2001."},{"key":"7749_CR13","doi-asserted-by":"publisher","first-page":"575","DOI":"10.3103\/s014641161407030x","volume":"48","author":"V.V. Vasilchikov","year":"2014","unstructured":"Vasilchikov, V.V., On the recursive-parallel programming for the. NET framework, Autom. Control Comput. Sci., 2014, vol. 48, no. 7, pp. 575\u2013580. https:\/\/doi.org\/10.3103\/s014641161407030x","journal-title":"Autom. Control Comput. Sci."}],"container-title":["Automatic Control and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411624700287.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.3103\/S0146411624700287","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411624700287.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:02:34Z","timestamp":1773612154000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.3103\/S0146411624700287"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12]]},"references-count":13,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["7749"],"URL":"https:\/\/doi.org\/10.3103\/s0146411624700287","relation":{},"ISSN":["0146-4116","1558-108X"],"issn-type":[{"value":"0146-4116","type":"print"},{"value":"1558-108X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12]]},"assertion":[{"value":"22 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 May 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 February 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The author of this work declares that he has no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"CONFLICT OF INTEREST"}}]}}