{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T11:45:55Z","timestamp":1695469555071},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2023,3,11]],"date-time":"2023-03-11T00:00:00Z","timestamp":1678492800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,11]],"date-time":"2023-03-11T00:00:00Z","timestamp":1678492800000},"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":["Algorithmica"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s00453-023-01108-0","type":"journal-article","created":{"date-parts":[[2023,3,26]],"date-time":"2023-03-26T21:50:55Z","timestamp":1679867455000},"page":"2554-2579","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Monotone Arithmetic Complexity of Graph Homomorphism Polynomials"],"prefix":"10.1007","volume":"85","author":[{"given":"Balagopal","family":"Komarath","sequence":"first","affiliation":[]},{"given":"Anurag","family":"Pandey","sequence":"additional","affiliation":[]},{"given":"C. S.","family":"Rahul","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,11]]},"reference":[{"issue":"4","key":"1108_CR1","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF02125347","volume":"9","author":"FRK Chung","year":"1989","unstructured":"Chung, F.R.K., Graham, R.L., Wilson, R.M.: Quasi-random graphs. Combinatorica 9(4), 345\u2013362 (1989). https:\/\/doi.org\/10.1007\/BF02125347","journal-title":"Combinatorica"},{"key":"1108_CR2","doi-asserted-by":"publisher","unstructured":"Lov\u00e1sz, L.: Large Networks and Graph Limits. American Mathematical Society Colloquium Publications, vol. 60, p. 475. American Mathematical Society, Providence, RI, USA (2012). https:\/\/doi.org\/10.1090\/coll\/060","DOI":"10.1090\/coll\/060"},{"issue":"1","key":"1108_CR3","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.jctb.2007.06.005","volume":"98","author":"L Lov\u00e1sz","year":"2008","unstructured":"Lov\u00e1sz, L., S\u00f3s, V.T.: Generalized quasirandom graphs. J. Combin. Theory Ser. B 98(1), 146\u2013163 (2008). https:\/\/doi.org\/10.1016\/j.jctb.2007.06.005","journal-title":"J. Combin. Theory Ser. B"},{"key":"1108_CR4","doi-asserted-by":"publisher","unstructured":"Alon, N., Dao, P., Hajirasouliha, I., Hormozdiari, F., Sahinalp, S.C.: Biomolecular network motif counting and discovery by color coding. In: Proceedings 16th International Conference on Intelligent Systems for Molecular Biology (ISMB), Toronto, Canada, July 19\u201323, (2008), pp. 241\u2013249 (2008). https:\/\/doi.org\/10.1093\/bioinformatics\/btn163","DOI":"10.1093\/bioinformatics\/btn163"},{"issue":"5594","key":"1108_CR5","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network motifs: simple building blocks of complex networks. Science 298(5594), 824\u2013827 (2002). https:\/\/doi.org\/10.1126\/science.298.5594.824","journal-title":"Science"},{"key":"1108_CR6","unstructured":"Borgelt, C., Berthold, M.R.: Mining molecular fragments: finding relevant substructures of molecules. In: 2002 IEEE International Conference on Data Mining, 2002. Proceedings, pp. 51\u201358 (2002)"},{"key":"1108_CR7","doi-asserted-by":"publisher","unstructured":"Kong, X., Zhang, J., Yu, P.S.: Inferring anchor links across multiple heterogeneous social networks. In: Proceedings of the 22nd ACM International Conference on Information & Knowledge Management. CIKM \u201913, pp. 179\u2013188. Association for Computing Machinery, New York, NY, USA (2013). https:\/\/doi.org\/10.1145\/2505515.2505531","DOI":"10.1145\/2505515.2505531"},{"key":"1108_CR8","unstructured":"Zhang, J., Wu, G.: Targeting social advertising to friends of users who have interacted with an object associated with the advertising (Dec. 15 2010. US Patent App. 12\/968,786)"},{"key":"1108_CR9","doi-asserted-by":"publisher","unstructured":"Zhao, H., Yao, Q., Li, J., Song, Y., Lee, D.L.: Meta-graph based recommendation fusion over heterogeneous information networks. In: KDD, pp. 635\u2013644 (2017). https:\/\/doi.org\/10.1145\/3097983.3098063","DOI":"10.1145\/3097983.3098063"},{"key":"1108_CR10","doi-asserted-by":"crossref","unstructured":"Borgs, C., Chayes, J., Lov\u00e1sz, L., S\u00f3s, V.T., Vesztergombi, K.: Counting graph homomorphisms. In: Topics in Discrete Mathematics, pp. 315\u2013371. Springer, USA (2006)","DOI":"10.1007\/3-540-33700-8_18"},{"key":"1108_CR11","doi-asserted-by":"publisher","unstructured":"Marx, D., Pilipczuk, M.: Everything you always wanted to know about the parameterized complexity of subgraph isomorphism (but were afraid to ask). In: Mayr, E.W., Portier, N. (eds.) 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), STACS 2014, March 5\u20138, 2014, Lyon, France. LIPIcs, vol. 25, pp. 542\u2013553. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Germany (2014). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2014.542","DOI":"10.4230\/LIPIcs.STACS.2014.542"},{"key":"1108_CR12","doi-asserted-by":"publisher","unstructured":"Bl\u00e4ser, M., Komarath, B., Sreenivasaiah, K.: Graph pattern polynomials. In: Ganguly, S., Pandya, P.K. (eds.) 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2018, December 11\u201313, 2018, Ahmedabad, India. LIPIcs, vol. 122, pp. 18\u201311813. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Germany (2018). https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2018.18","DOI":"10.4230\/LIPIcs.FSTTCS.2018.18"},{"key":"1108_CR13","doi-asserted-by":"publisher","unstructured":"Liu, X., Pan, H., He, M., Song, Y., Jiang, X., Shang, L.: Neural subgraph isomorphism counting. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. KDD \u201920, pp. 1959\u20131969. Association for Computing Machinery, New York, NY, USA (2020). https:\/\/doi.org\/10.1145\/3394486.3403247","DOI":"10.1145\/3394486.3403247"},{"issue":"3","key":"1108_CR14","doi-asserted-by":"publisher","first-page":"936","DOI":"10.1137\/14099721X","volume":"46","author":"Y Li","year":"2017","unstructured":"Li, Y., Razborov, A.A., Rossman, B.: On the ac$${}^{\\text{0 }}$$ complexity of subgraph isomorphism. SIAM J. Comput. 46(3), 936\u2013971 (2017). https:\/\/doi.org\/10.1137\/14099721X","journal-title":"SIAM J. Comput."},{"key":"1108_CR15","doi-asserted-by":"publisher","first-page":"85","DOI":"10.4086\/toc.2010.v006a005","volume":"6","author":"D Marx","year":"2010","unstructured":"Marx, D.: Can you beat treewidth? Theory Comput. 6, 85\u2013112 (2010). https:\/\/doi.org\/10.4086\/toc.2010.v006a005","journal-title":"Theory Comput."},{"key":"1108_CR16","doi-asserted-by":"crossref","unstructured":"Rossman, B.: Lower bounds for subgraph isomorphism. In: Proceedings of the International Congress of Mathematicians\u2014Rio de Janeiro 2018. Vol. IV. Invited lectures, pp. 3425\u20133446. World Scientific Publishing, Hackensack, NJ, USA (2018)","DOI":"10.1142\/9789813272880_0187"},{"key":"1108_CR17","doi-asserted-by":"crossref","unstructured":"Kush, D., Rossman, B.: Tree-depth and the formula complexity of subgraph isomorphism. CoRR arXiv:2004.13302 (2020)","DOI":"10.1109\/FOCS46700.2020.00012"},{"key":"1108_CR18","doi-asserted-by":"publisher","unstructured":"Curticapean, R., Dell, H., Marx, D.: Homomorphisms are a good basis for counting small subgraphs. In: Hatami, H., McKenzie, P., King, V. (eds.) Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19\u201323, 2017, pp. 210\u2013223. ACM, USA (2017). https:\/\/doi.org\/10.1145\/3055399.3055502","DOI":"10.1145\/3055399.3055502"},{"issue":"1\u20132","key":"1108_CR19","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0304-3975(02)00017-8","volume":"281","author":"J D\u00edaz","year":"2002","unstructured":"D\u00edaz, J., Serna, M.J., Thilikos, D.M.: Counting h-colorings of partial k-trees. Theor. Comput. Sci. 281(1\u20132), 291\u2013309 (2002). https:\/\/doi.org\/10.1016\/S0304-3975(02)00017-8","journal-title":"Theor. Comput. Sci."},{"issue":"3\u20134","key":"1108_CR20","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. Inf. Process. Lett. 74(3\u20134), 115\u2013121 (2000). https:\/\/doi.org\/10.1016\/S0020-0190(00)00047-8","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"1108_CR21","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1137\/110859798","volume":"27","author":"M Kowaluk","year":"2013","unstructured":"Kowaluk, M., Lingas, A., Lundell, E.: Counting and detecting small subgraphs via equations. SIAM J. Discrete Math. 27(2), 892\u2013909 (2013). https:\/\/doi.org\/10.1137\/110859798","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"1108_CR22","doi-asserted-by":"publisher","first-page":"1322","DOI":"10.1137\/140978211","volume":"29","author":"P Floderus","year":"2015","unstructured":"Floderus, P., Kowaluk, M., Lingas, A., Lundell, E.: Detecting and counting small pattern graphs. SIAM J. Discrete Math. 29(3), 1322\u20131339 (2015). https:\/\/doi.org\/10.1137\/140978211","journal-title":"SIAM J. Discrete Math."},{"key":"1108_CR23","doi-asserted-by":"publisher","unstructured":"Williams, V.V., Wang, J.R., Williams, R.R., Yu, H.: Finding four-node subgraphs in triangle time. In: Indyk, P. (ed.) Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4\u20136, 2015, pp. 1671\u20131680. SIAM, USA (2015). https:\/\/doi.org\/10.1137\/1.9781611973730.111","DOI":"10.1137\/1.9781611973730.111"},{"key":"1108_CR24","unstructured":"Saptharishi, R.: A survey of lower bounds in arithmetic circuit complexity. Github Survey (2015)"},{"key":"1108_CR25","unstructured":"Durand, A., Mahajan, M., Malod, G., de Rugy-Altherre, N., Saurabh, N.: Homomorphism polynomials complete for VP. Chic. J. Theor. Comput. Sci. 2016 (2016)"},{"issue":"3","key":"1108_CR26","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1007\/s00224-016-9740-y","volume":"62","author":"M Mahajan","year":"2018","unstructured":"Mahajan, M., Saurabh, N.: Some complete and intermediate polynomials in algebraic complexity theory. Theory Comput. Syst. 62(3), 622\u2013652 (2018). https:\/\/doi.org\/10.1007\/s00224-016-9740-y","journal-title":"Theory Comput. Syst."},{"key":"1108_CR27","doi-asserted-by":"publisher","unstructured":"Chaugule, P., Limaye, N., Varre, A.: Variants of homomorphism polynomials complete for algebraic complexity classes. In: Computing and Combinatorics - 25th International Conference, COCOON 2019, Xi\u2019an, China, July 29\u201331, 2019, Proceedings. Lecture Notes in Computer Science, vol. 11653, pp. 90\u2013102. Springer, USA (2019). https:\/\/doi.org\/10.1007\/978-3-030-26176-4_8","DOI":"10.1007\/978-3-030-26176-4_8"},{"issue":"1","key":"1108_CR28","doi-asserted-by":"publisher","first-page":"3","DOI":"10.7155\/jgaa.00382","volume":"20","author":"C Engels","year":"2016","unstructured":"Engels, C.: Dichotomy theorems for homomorphism polynomials of graph classes. J. Graph Algorithms Appl. 20(1), 3\u201322 (2016). https:\/\/doi.org\/10.7155\/jgaa.00382","journal-title":"J. Graph Algorithms Appl."},{"issue":"1\u20133","key":"1108_CR29","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.tcs.2004.08.008","volume":"329","author":"V Dalmau","year":"2004","unstructured":"Dalmau, V., Jonsson, P.: The complexity of counting homomorphisms seen from the other side. Theoret. Comput. Sci. 329(1\u20133), 315\u2013323 (2004). https:\/\/doi.org\/10.1016\/j.tcs.2004.08.008","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"1108_CR30","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0304-3975(76)90083-9","volume":"2","author":"CP Schnorr","year":"1976","unstructured":"Schnorr, C.P.: A lower bound on the number of additions in monotone computations. Theoret. Comput. Sci. 2(3), 305\u2013315 (1976). https:\/\/doi.org\/10.1016\/0304-3975(76)90083-9","journal-title":"Theoret. Comput. Sci."},{"key":"1108_CR31","unstructured":"Grenet, B.: An Upper Bound for the Permanent versus Determinant Problem (2012)"},{"key":"1108_CR32","doi-asserted-by":"crossref","unstructured":"Snir, M.: On the size complexity of monotone formulas. In: de Bakker, J., van Leeuwen, J. (eds.) Automata, Languages and Programming, pp. 621\u2013631. Springer, Berlin, Heidelberg (1980)","DOI":"10.1007\/3-540-10003-2_103"},{"key":"1108_CR33","doi-asserted-by":"publisher","unstructured":"Hrubes, P., Yehudayoff, A.: On isoperimetric profiles and computational complexity. In: 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11\u201315, 2016, Rome, Italy, pp. 89\u201318912 (2016). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2016.89","DOI":"10.4230\/LIPIcs.ICALP.2016.89"},{"key":"1108_CR34","doi-asserted-by":"publisher","unstructured":"Yehudayoff, A.: Separating monotone vp and vnp. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. STOC 2019, pp. 425\u2013429. Association for Computing Machinery, New York, NY, USA (2019). https:\/\/doi.org\/10.1145\/3313276.3316311","DOI":"10.1145\/3313276.3316311"},{"key":"1108_CR35","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0304-3975(83)90110-X","volume":"22","author":"W Baur","year":"1983","unstructured":"Baur, W., Strassen, V.: The complexity of partial derivatives. Theor. Comput. Sci. 22, 317\u2013330 (1983). https:\/\/doi.org\/10.1016\/0304-3975(83)90110-X","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"1108_CR36","first-page":"415","volume":"026","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. 026(2), 415\u2013419 (1985)","journal-title":"Comment. Math. Univ. Carol."},{"key":"1108_CR37","doi-asserted-by":"publisher","unstructured":"Cavalar, B.P., Kumar, M., Rossman, B.: Monotone circuit lower bounds from robust sunflowers. In: LATIN 2020: Theoretical Informatics: 14th Latin American Symposium, S\u00e3o Paulo, Brazil, January 5\u20138, 2021, Proceedings, pp. 311\u2013322 (2021). https:\/\/doi.org\/10.1007\/978-3-030-61792-9_25","DOI":"10.1007\/978-3-030-61792-9_25"},{"key":"1108_CR38","unstructured":"Chattopadhyay, A., Datta, R., Mukhopadhyay, P.: Negations provide strongly exponential savings. Electron. Colloquium Comput. Complex. 191 (2020)"},{"key":"1108_CR39","doi-asserted-by":"publisher","unstructured":"Chattopadhyay, A., Datta, R., Mukhopadhyay, P.: Lower Bounds for Monotone Arithmetic Circuits via Communication Complexity, pp. 786\u2013799. Association for Computing Machinery, New York, NY, USA (2021). https:\/\/doi.org\/10.1145\/3406325.3451069","DOI":"10.1145\/3406325.3451069"},{"key":"1108_CR40","doi-asserted-by":"publisher","DOI":"10.1145\/3417758","author":"S Srinivasan","year":"2020","unstructured":"Srinivasan, S.: Strongly exponential separation between monotone vp and monotone vnp. ACM Trans. Comput. Theory (2020). https:\/\/doi.org\/10.1145\/3417758","journal-title":"ACM Trans. Comput. Theory"},{"issue":"3","key":"1108_CR41","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1145\/322326.322341","volume":"29","author":"M Jerrum","year":"1982","unstructured":"Jerrum, M., Snir, M.: Some exact complexity results for straight-line computations over semirings. J. ACM 29(3), 874\u2013897 (1982). https:\/\/doi.org\/10.1145\/322326.322341","journal-title":"J. ACM"},{"issue":"1","key":"1108_CR42","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.jcss.2010.06.013","volume":"77","author":"R Raz","year":"2011","unstructured":"Raz, R., Yehudayoff, A.: Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors. J. Comput. Syst. Sci. 77(1), 167\u2013190 (2011). https:\/\/doi.org\/10.1016\/j.jcss.2010.06.013","journal-title":"J. Comput. Syst. Sci."},{"key":"1108_CR43","doi-asserted-by":"publisher","unstructured":"Fournier, H., Malod, G., Szusterman, M., Tavenas, S.: Nonnegative Rank Measures and Monotone Algebraic Branching Programs. In: Chattopadhyay, A., Gastin, P. (eds.) 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), vol. 150, pp. 15\u201311514. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2019). https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2019.15. https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2019\/11577","DOI":"10.4230\/LIPIcs.FSTTCS.2019.15"},{"key":"1108_CR44","doi-asserted-by":"publisher","unstructured":"Nisan, N.: Lower bounds for non-commutative computation. In: Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing. STOC \u201991, pp. 410\u2013418. Association for Computing Machinery, New York, NY, USA (1991). https:\/\/doi.org\/10.1145\/103418.103462","DOI":"10.1145\/103418.103462"},{"key":"1108_CR45","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2000","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Ohio (2000)","edition":"2"},{"key":"1108_CR46","unstructured":"Diestel, R.: Graph Theory. Electronic library of mathematics. Springer, New York (2006). https:\/\/books.google.de\/books?id=aR2TMYQr2CMC"},{"key":"1108_CR47","unstructured":"Sarma, J.: Personal Communication"},{"key":"1108_CR48","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.dam.2016.04.024","volume":"213","author":"S Jukna","year":"2016","unstructured":"Jukna, S.: Lower bounds for monotone counting circuits. Discrete Appl. Math. 213, 139\u2013152 (2016)","journal-title":"Discrete Appl. Math."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-023-01108-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-023-01108-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-023-01108-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T15:03:21Z","timestamp":1695395001000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-023-01108-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,11]]},"references-count":48,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["1108"],"URL":"https:\/\/doi.org\/10.1007\/s00453-023-01108-0","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,11]]},"assertion":[{"value":"1 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflicts of interest to declare. Balagopal Komarath was supported by the Discipline of Computer Science at IIT Gandhinagar. Anurag Pandey was funded by the chairs of Raimund Seidel and Markus Bl\u00e4ser from the Department of Computer Science at Saarland University. Rahul C S was supported by the Department of Computer Science at IIT Goa. Parts of this work was done while Balagopal Komarath was supported by the chair of Markus Bl\u00e4ser from the Department of Computer Science at Saarland University and Rahul C S was supported by BITS Pilani, Dubai Campus.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}