{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T04:03:17Z","timestamp":1689220997138},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2023,4,9]],"date-time":"2023-04-09T00:00:00Z","timestamp":1680998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,9]],"date-time":"2023-04-09T00:00:00Z","timestamp":1680998400000},"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":["Optim Lett"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s11590-023-02001-z","type":"journal-article","created":{"date-parts":[[2023,4,9]],"date-time":"2023-04-09T15:02:26Z","timestamp":1681052546000},"page":"1533-1549","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On linear algebraic algorithms for the subgraph matching problem and its variants"],"prefix":"10.1007","volume":"17","author":[{"given":"Maxim D.","family":"Emelin","sequence":"first","affiliation":[]},{"given":"Ilya A.","family":"Khlystov","sequence":"additional","affiliation":[]},{"given":"Dmitry S.","family":"Malyshev","sequence":"additional","affiliation":[]},{"given":"Olga O.","family":"Razvenskaya","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,9]]},"reference":[{"issue":"3","key":"2001_CR1","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/s10115-016-0965-5","volume":"50","author":"N Ahmed","year":"2017","unstructured":"Ahmed, N., et al.: Graphlet decomposition: framework, algorithms, and applications. Knowl. Inf. Syst. 50(3), 689\u2013722 (2017)","journal-title":"Knowl. Inf. Syst."},{"issue":"13","key":"2001_CR2","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1093\/bioinformatics\/btn163","volume":"24","author":"N Alon","year":"2008","unstructured":"Alon, N., et al.: Biomolecular network motif counting and discovery by color coding. Bioinformatics 24(13), 241\u2013249 (2008)","journal-title":"Bioinformatics"},{"key":"2001_CR3","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF02523189","volume":"17","author":"N Alon","year":"1997","unstructured":"Alon, N., Yuster, R., Zwick, U.: Finding and counting given length cycles. Algorithmica 17, 209\u2013223 (1997)","journal-title":"Algorithmica"},{"key":"2001_CR4","unstructured":"Bonne, M., Censor-Hillel, K.: Distributed detection of cliques in dynamic networks. In: Baier, C., Chatzigiannakis, I., Flocchini, P., Leonardi, S. (eds.) Proceedings of International Colloquium on Automata, Languages, and Programming, pp 132:1\u2013132:15. Dagstuhl Publishing (2019)"},{"key":"2001_CR5","doi-asserted-by":"crossref","unstructured":"Chakaravarthy, V., et al.: Subgraph counting: Color coding beyond trees. In: O\u2019Conner, L. (ed.) International Symposium on Parallel and Distributed Processing Symposium Proceedings, pp 2\u201311. Piscataway, IEEE (2016)","DOI":"10.1109\/IPDPS.2016.122"},{"key":"2001_CR6","doi-asserted-by":"publisher","unstructured":"Chen, L., et al.: A GraphBLAS approach for subgraph counting. ArXiv, https:\/\/doi.org\/10.48550\/arXiv.1903.04395.","DOI":"10.48550\/arXiv.1903.04395."},{"issue":"1","key":"2001_CR7","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM J. Comput. 14(1), 210\u2013223 (1985)","journal-title":"SIAM J. Comput."},{"key":"2001_CR8","doi-asserted-by":"crossref","unstructured":"Danisch, M., Balalau, O., Sozio, M.: Listing $$k$$-cliques in sparse real-world graphs. In: Champin, P.-A. et al. (eds.) Proceedings of International Conference on World Wide Web, pp 589\u2013598. International WWW Conference Committee (2018)","DOI":"10.1145\/3178876.3186125"},{"key":"2001_CR9","doi-asserted-by":"crossref","unstructured":"Dave, V., Ahmed, N., Hasan, M.: PE-CLoG: Counting edge-centric local graphlets. In: Nie, J-Y et al. (eds.) Proceedings of International Conference on Big Data, pp 586\u2013595. IEEE, Piscataway (2017)","DOI":"10.1109\/BigData.2017.8257974"},{"key":"2001_CR10","doi-asserted-by":"crossref","unstructured":"Dhulipala, L., Liu, Q., Shun, J., Yu, S.: Parallel batch-dynamic $$k$$-clique counting. In: Shapira, M. (ed.) Proceedings of Symposium on Algorithmic Principles of Computer Science, pp. 129\u2013143. SIAM, Philadelphia (2021)","DOI":"10.1137\/1.9781611976489.10"},{"key":"2001_CR11","doi-asserted-by":"crossref","unstructured":"Dvorak, Z., Tuma, V.: A dynamic data structure for counting subgraphs in sparse graphs. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) Proceedings of Workshop on Algorithms and Data Structures, pp. 304\u2013315. Springer-Verlag, Berlin (2013)","DOI":"10.1007\/978-3-642-40104-6_27"},{"issue":"1\u20133","key":"2001_CR12","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2004.05.009","volume":"326","author":"F Eisenbrand","year":"2004","unstructured":"Eisenbrand, F., Grandoni, F.: On the complexity of fixed parameter clique and dominating set. Theoret. Comput. Sci. 326(1\u20133), 57\u201367 (2004)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"2001_CR13","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0020-0190(94)90121-X","volume":"51","author":"D Eppstein","year":"1994","unstructured":"Eppstein, D.: Arboricity and bipartite subgraph listing algorithms. Inf. Process. Lett. 51(4), 207\u2013211 (1994)","journal-title":"Inf. Process. Lett."},{"key":"2001_CR14","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.tcs.2011.11.034","volume":"447","author":"D Eppstein","year":"2012","unstructured":"Eppstein, D., Goodrich, M., Strash, D., Trott, L.: Extended dynamic subgraph statistics using h-index parameterized data structures. Theoret. Comput. Sci. 447, 44\u201352 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"2001_CR15","doi-asserted-by":"crossref","unstructured":"Eppstein, D., Spiro, E.: The h-index of a graph and its application to dynamic subgraph statistics. In: Dehne, F., Gavrilova, M., Sack, J., T\u00f3th, C. (eds.) Proceedings of Workshop on Algorithms and Data Structures, pp 278\u2013289. Springer-Verlag, Berlin (2009)","DOI":"10.1007\/978-3-642-03367-4_25"},{"key":"2001_CR16","first-page":"1.7:1","volume":"20","author":"F Finocchi","year":"2015","unstructured":"Finocchi, F., Finocchi, M., Fusco, E.: Clique counting in MapReduce: algorithms and experiments. J. Experimen. Algorithmics 20, 1.7:1-1.7:20 (2015)","journal-title":"J. Experimen. Algorithmics"},{"key":"2001_CR17","doi-asserted-by":"crossref","unstructured":"Goodrich, M., Pszona, P.: External-memory network analysis algorithms for naturally sparse graphs. In: Demetrescu, C., Halld\u00f3rsson, M (eds.) Proceedings of European Symposium on Algorithms, pp 664\u2013676. 2011. Springer-Verlag, Berlin (2011)","DOI":"10.1007\/978-3-642-23719-5_56"},{"key":"2001_CR18","doi-asserted-by":"crossref","unstructured":"Greyser, V., Soszynski, A., Kao, E.: Leveraging linear algebra to count and enumerate simple subgraphs. In: Proceedings of High Performance Extreme Computing Conference, pp. 1-8. IEEE, Piscataway (2020)","DOI":"10.1109\/HPEC43674.2020.9286191"},{"key":"2001_CR19","doi-asserted-by":"crossref","unstructured":"Jain, S., Seshadhri., C.: The power of pivoting for exact clique counting. In: Caveree, J., Hu, B., Lalmas, M., Wang, W. (eds.) Proceedings of the 13th International Conference on Web Search and Data Mining, pp. 268\u2013277. Association for Computing Machinery, New York (2020)","DOI":"10.1145\/3336191.3371839"},{"key":"2001_CR20","unstructured":"Kara, A., et al.: Counting triangles under updates in worst-case optimal time. In: Barcelo, P., Calautti, M. (eds.) Proceedings of International Conference on Database Theory, pp 4:1\u20134:18. Dagstuhl Publishing (2019)"},{"key":"2001_CR21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719918","volume-title":"Graph algorithms in the language of linear algebra","author":"J Kepner","year":"2011","unstructured":"Kepner, J., Gilbert, J.: Graph algorithms in the language of linear algebra. SIAM, Philadelphia (2011)"},{"issue":"3\u20134","key":"2001_CR22","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0020-0190(00)00047-8","volume":"74","author":"T Kloks","year":"2000","unstructured":"Kloks, T., Kratsch, D., M\u00fcller, H.: Finding and counting small induced subgraphs efficiently. Inform. Process. Lett. 74(3\u20134), 115\u2013121 (2000)","journal-title":"Inform. Process. Lett."},{"issue":"10","key":"2001_CR23","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.14778\/3339490.3339494","volume":"12","author":"L Lai","year":"2019","unstructured":"Lai, L., et al.: Distributed subgraph matching on timely dataflow. Proc. VLDB Endow. 12(10), 1099\u20131112 (2019)","journal-title":"Proc. VLDB Endow."},{"issue":"1\u20133","key":"2001_CR24","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1016\/j.tcs.2008.07.017","volume":"407","author":"M Latapy","year":"2008","unstructured":"Latapy, M.: Main-memory triangle computations for very large (sparse (power-law)) graphs. Theoret. Comput. Sci. 407(1\u20133), 458\u2013473 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"2001_CR25","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford Large Network Dataset Collection.http:\/\/snap.stanford.edu\/data (2022). Accessed 30 December 2022"},{"issue":"934637","key":"2001_CR26","first-page":"15","volume":"2014","author":"J L\u00f3pez-Presa","year":"2014","unstructured":"L\u00f3pez-Presa, J., Chiroque, L., Anta, A.: Novel techniques to speed up the computation of the automorphism group of a graph. J. Appl. Math. 2014(934637), 15 (2014)","journal-title":"J. Appl. Math."},{"key":"2001_CR27","doi-asserted-by":"crossref","unstructured":"Makkar, D., Bader, D., Green, O.: Exact and parallel triangle counting in dynamic graphs. In: Smari, W. (ed.) Proceedings of International Conference on High Performance Computing and Simulation, pp 2\u201312. IEEE, Piscataway (2017)","DOI":"10.1109\/HiPC.2017.00011"},{"key":"2001_CR28","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","volume":"60","author":"B McCay","year":"2014","unstructured":"McCay, B., Piperno, A.: Practical graph isomorphism, II. J. Symb. Comput. 60, 94\u2013112 (2014)","journal-title":"J. Symb. Comput."},{"issue":"11","key":"2001_CR29","doi-asserted-by":"publisher","first-page":"1692","DOI":"10.14778\/3342263.3342643","volume":"12","author":"A Mhedhbi","year":"2019","unstructured":"Mhedhbi, A., Salihoglu, S.: Optimizing subgraph queries by combining binary and worst-case optimal joins. Proc. VLDB Endow. 12(11), 1692\u20131704 (2019)","journal-title":"Proc. VLDB Endow."},{"issue":"2","key":"2001_CR30","first-page":"415","volume":"26","author":"J Ne\u0161et\u0159il","year":"1985","unstructured":"Ne\u0161et\u0159il, J., Poljak, S.: On the complexity of the subgraph problem. Comment. Math. Univ. Carol. 26(2), 415\u2013419 (1985)","journal-title":"Comment. Math. Univ. Carol."},{"key":"2001_CR31","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(81)90041-7","volume":"13","author":"C Papadimitriou","year":"1981","unstructured":"Papadimitriou, C., Yannakakis, M.: The clique problem for planar graphs. Inf. Process. Lett. 13, 131\u2013133 (1981)","journal-title":"Inf. Process. Lett."},{"key":"2001_CR32","doi-asserted-by":"crossref","unstructured":"Pinar, A., Seshadhri,C., Vishal, V.: ESCAPE: Efficiently counting all 5-vertex subgraphs. In: Barrett, R., Cummings, R. (eds.) Proceedings of International Conference on World Wide Web, pp. 1431\u20131440. International WWW Conference Committee (2017)","DOI":"10.1145\/3038912.3052597"},{"key":"2001_CR33","doi-asserted-by":"crossref","unstructured":"Shi, J., Dhulipala, L., Shun, J.: Parallel clique counting and peeling algorithms. In: Bender, M., Gilbert, J., Hendrickson, B., Sullivan, B. (eds.) Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms, pp. SIAM, Philadelphia (2021)","DOI":"10.1137\/1.9781611976830.13"},{"issue":"1.15","key":"2001_CR34","first-page":"1","volume":"24","author":"S Stoichev","year":"2019","unstructured":"Stoichev, S.: New exact and heuristic algorithms for graph automorphism group and graph isomorphism. ACM J. Experimen. Algorithmics 24(1.15), 1\u201327 (2019)","journal-title":"ACM J. Experimen. Algorithmics"},{"issue":"9","key":"2001_CR35","doi-asserted-by":"publisher","first-page":"788","DOI":"10.14778\/2311906.2311907","volume":"5","author":"Z Sun","year":"2012","unstructured":"Sun, Z., et al.: Efficient subgraph matching on billion node graphs. Proc. VLDB Endow. 5(9), 788\u2013799 (2012)","journal-title":"Proc. VLDB Endow."},{"issue":"4","key":"2001_CR36","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/j.ipl.2008.10.014","volume":"109","author":"V Vassilevska","year":"2009","unstructured":"Vassilevska, V.: Efficient algorithms for clique problems. Inf. Process. Lett. 109(4), 254\u2013257 (2009)","journal-title":"Inf. Process. Lett."},{"key":"2001_CR37","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D Watts","year":"1998","unstructured":"Watts, D., Strogatz, S.: Collective dynamics of small-world networks. Nature 393, 440\u2013442 (1998)","journal-title":"Nature"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-02001-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-023-02001-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-02001-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T13:25:53Z","timestamp":1689168353000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-023-02001-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,9]]},"references-count":37,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["2001"],"URL":"https:\/\/doi.org\/10.1007\/s11590-023-02001-z","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,9]]},"assertion":[{"value":"11 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}