{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:15:16Z","timestamp":1761808516767,"version":"3.37.3"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,4,20]],"date-time":"2022-04-20T00:00:00Z","timestamp":1650412800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,20]],"date-time":"2022-04-20T00:00:00Z","timestamp":1650412800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"crossref","award":["J1-8155"],"award-info":[{"award-number":["J1-8155"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"publisher","award":["N1-0057","N1-0071"],"award-info":[{"award-number":["N1-0057","N1-0071"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"publisher","award":["P2-0248"],"award-info":[{"award-number":["P2-0248"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s40314-022-01835-0","type":"journal-article","created":{"date-parts":[[2022,4,20]],"date-time":"2022-04-20T07:02:32Z","timestamp":1650438152000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Clustering as a dual problem to colouring"],"prefix":"10.1007","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2367-8610","authenticated-orcid":false,"given":"Barbara","family":"Ikica","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo\u0161tjan","family":"Gabrov\u0161ek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9856-1476","authenticated-orcid":false,"given":"Janez","family":"Povh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janez","family":"\u017derovnik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,20]]},"reference":[{"key":"1835_CR1","doi-asserted-by":"crossref","unstructured":"Adamic L. A, Glance N (2005) The Political Blogosphere and the 2004 U.S. Election: Divided They Blog in Proceedings of the 3rd International Workshop on Link Discovery (ACM), 36-43","DOI":"10.1145\/1134271.1134277"},{"key":"1835_CR2","doi-asserted-by":"crossref","unstructured":"Almeida H, Guedes D, Meira W, Zaki M. J (2011) Is there a best quality metric for graph clusters? in Joint European Conference on Machine Learning and Knowledge Discovery in Databases , 44-59","DOI":"10.1007\/978-3-642-23780-5_13"},{"issue":"3","key":"1835_CR3","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1093\/bib\/bbn058","volume":"10","author":"B Andreopoulos","year":"2009","unstructured":"Andreopoulos B, An A, Wang X, Schroeder M (2009) A roadmap of clustering algorithms: finding a match for a biomedical application. Brief. Bioinform. 10(3):297\u2013314","journal-title":"Brief. Bioinform."},{"key":"1835_CR4","volume-title":"Network science","author":"AL Barab\u00e1si","year":"2016","unstructured":"Barab\u00e1si AL et al (2016) Network science. Cambridge University Press, Cambridge, UK"},{"issue":"2","key":"1835_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1109\/MCSE.2010.118","volume":"13","author":"S Behnel","year":"2011","unstructured":"Behnel S et al (2011) Cython: The Best of Both Worlds. Comput. Sci. Eng. 13(2):31\u201339","journal-title":"Comput. Sci. Eng."},{"key":"1835_CR6","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"10","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume JL, Lambiotte R, Lefebvre E (2008) Fast unfolding of community hierarchies in large networks. J. Stat. Mech: Theory Exp. 10:P10008","journal-title":"J. Stat. Mech: Theory Exp."},{"issue":"6","key":"1835_CR7","doi-asserted-by":"publisher","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset A, Newman MEJ, Moore C (2004) Finding community structure in very large networks. Phys. Rev. E 70(6):066111","journal-title":"Phys. Rev. E"},{"key":"1835_CR8","unstructured":"Cora citation network dataset (2017) http:\/\/konect.uni-koblenz.de\/networks\/subelj_cora. KONECT. Accessed Apr 2017"},{"key":"1835_CR9","unstructured":"Cover T. M, Thomas J. A (2006) Elements of Information Theory 2nd ed. (Wiley-Interscience)"},{"issue":"5","key":"1835_CR10","first-page":"1","volume":"1695","author":"G Cs\u00e1rdi","year":"2006","unstructured":"Cs\u00e1rdi G, Nepusz T (2006) The igraph software package for complex network research. InterJ. Complex Syst. 1695(5):1\u20139","journal-title":"InterJ. Complex Syst."},{"key":"1835_CR11","doi-asserted-by":"crossref","unstructured":"D\u2019haeseleer P (2005) How does gene expression clustering work? Nat. Biotechnol. 23, 1499-1501","DOI":"10.1038\/nbt1205-1499"},{"issue":"9","key":"1835_CR12","doi-asserted-by":"publisher","first-page":"P09008","DOI":"10.1088\/1742-5468\/2005\/09\/P09008","volume":"2005","author":"L Danon","year":"2005","unstructured":"Danon L, D\u00edaz-Guilera A, Duch J, Arenas A (2005) Comparing community structure identification. J. Stat. Mech: Theory Exp. 2005(9):P09008","journal-title":"J. Stat. Mech: Theory Exp."},{"key":"1835_CR13","volume-title":"Metaheuristic Clustering","author":"S Das","year":"2009","unstructured":"Das S, Abraham A, Konar A (2009) Metaheuristic Clustering, 1st edn. Springer, Berlin, Heidelberg","edition":"1"},{"issue":"1","key":"1835_CR14","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1017\/S0305004100060989","volume":"94","author":"P Donnelly","year":"1983","unstructured":"Donnelly P, Welsh D (1983) Finite particle systems and infection models. Math. Proc. Cambridge Philos. Soc. 94(1):167\u2013182","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"issue":"7","key":"1835_CR15","doi-asserted-by":"publisher","first-page":"e0159161","DOI":"10.1371\/journal.pone.0159161","volume":"11","author":"S Emmons","year":"2016","unstructured":"Emmons S, Kobourov S, Gallant M, B\u00f6rner K (2016) Analysis of network clustering algorithms and cluster quality metrics at scale. PLoS One 11(7):e0159161","journal-title":"PLoS One"},{"key":"1835_CR16","unstructured":"Euroroad network dataset (2017) http:\/\/konect.uni-koblenz.de\/networks\/subelj_euroroad. KONECT. Accessed Apr 2017"},{"key":"1835_CR17","doi-asserted-by":"crossref","unstructured":"Evans T. S (2010) Clique graphs and overlapping communities. J. Stat. Mech: Theory Exp. P12037","DOI":"10.1088\/1742-5468\/2010\/12\/P12037"},{"key":"1835_CR18","unstructured":"Folium https:\/\/github.com\/python-visualization\/folium. Accessed Apr 2022"},{"issue":"3\u20135","key":"1835_CR19","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato S (2010) Community detection in graphs. Phys. Rep. 486(3\u20135):75\u2013174","journal-title":"Phys. Rep."},{"issue":"1","key":"1835_CR20","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1073\/pnas.0605965104","volume":"104","author":"S Fortunato","year":"2007","unstructured":"Fortunato S, Barthelemy M (2007) Resolution limit in community detection. Proc. Natl. Acad. Sci. U.S.A. 104(1):36\u201341","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"key":"1835_CR21","doi-asserted-by":"crossref","unstructured":"Gaertler M (2005) Clustering in Network Analysis: Methodological Foundations (eds Brandes, U. & Erlebach, T.) 1st ed., 178-215 (Springer, Berlin, Heidelberg)","DOI":"10.1007\/978-3-540-31955-9_8"},{"key":"1835_CR22","unstructured":"GeoPy https:\/\/github.com\/geopy\/geopy. Accessed Apr 2022"},{"issue":"12","key":"1835_CR23","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman MEJ (2002) Community structure in social and biological networks. Proc. Natl. Acad. Sci. U.S.A. 99(12):7821\u20137826","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"key":"1835_CR24","doi-asserted-by":"publisher","first-page":"12894","DOI":"10.1038\/srep12894","volume":"5","author":"CW Hu","year":"2015","unstructured":"Hu CW, Kornblau SM, Slater JH, Qutub AA (2015) Progeny Clustering: A Method to Identify Biological Phenotypes. Sci. Rep. 5:12894","journal-title":"Sci. Rep."},{"issue":"1","key":"1835_CR25","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert L, Arabie P (1985) Comparing partitions. J. Classif. 2(1):193\u2013218","journal-title":"J. Classif."},{"issue":"1","key":"1835_CR26","doi-asserted-by":"publisher","first-page":"33","DOI":"10.26493\/1855-3974.2079.7b1","volume":"18","author":"B Ikica","year":"2020","unstructured":"Ikica B (2020) Clustering via the Modified Petford-Welsh Algorithm. Ars Math. Contemp. 18(1):33\u201349","journal-title":"Ars Math. Contemp."},{"key":"1835_CR27","unstructured":"Ikica B (2019) Evolutionary dynamics on evolving graphs PhD thesis (Faculty of Mathematics and Physics, University of Ljubljana)"},{"issue":"4598","key":"1835_CR28","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"key":"1835_CR29","unstructured":"Krebs V. Amazon\u2019s sales data of political books http:\/\/www.orgnet.com\/"},{"issue":"4","key":"1835_CR30","doi-asserted-by":"publisher","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","volume":"78","author":"A Lancichinetti","year":"2008","unstructured":"Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys. Rev. E 78(4):046110","journal-title":"Phys. Rev. E"},{"issue":"3","key":"1835_CR31","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1016\/j.neucom.2014.04.084","volume":"151","author":"S Li","year":"2015","unstructured":"Li S, Lou H, Jiang W, Tang J (2015) Detecting community structure via synchronous label propagation. Neurocomputing 151(3):1063\u20131075","journal-title":"Neurocomputing"},{"issue":"4","key":"1835_CR32","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/s00265-003-0651-y","volume":"54","author":"D Lusseau","year":"2003","unstructured":"Lusseau D et al (2003) The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations. Behav. Ecol. Sociobiol. 54(4):396\u2013405","journal-title":"Behav. Ecol. Sociobiol."},{"issue":"4","key":"1835_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0094429","volume":"9","author":"B Lu\u017ear","year":"2014","unstructured":"Lu\u017ear B, Levnajic Z, Povh J, Perc M (2014) Community Structure and the Evolution of Interdisciplinarity in Slovenia\u2019s Scientific Collaboration Network. PLoS One 9(4):1\u20135","journal-title":"PLoS One"},{"issue":"1","key":"1835_CR34","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1038\/s41467-019-08797-8","volume":"10","author":"N Malod-Dognin","year":"2019","unstructured":"Malod-Dognin N et al (2019) Towards a data-integrated cell. Nat. Commun. 10(1):805","journal-title":"Nat. Commun."},{"issue":"2","key":"1835_CR35","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1023\/A:1009953814988","volume":"3","author":"AK McCallum","year":"2000","unstructured":"McCallum AK, Nigam K, Rennie J, Seymore K (2000) Automating the Construction of Internet Portals with Machine Learning. Inf. Retr. J. 3(2):127\u2013163","journal-title":"Inf. Retr. J."},{"issue":"5594","key":"1835_CR36","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo R et al (2002) Network Motifs: Simple Building Blocks of Complex Networks. Science 298(5594):824\u2013827","journal-title":"Science"},{"key":"1835_CR37","doi-asserted-by":"crossref","unstructured":"Nepusz T, Petr\u00f3czi A, N\u00e9gyessy L, Bazs\u00f3 F (2008) Fuzzy communities and the concept of bridgeness in complex networks. Phys. Rev. E 77(1):016107","DOI":"10.1103\/PhysRevE.77.016107"},{"issue":"3","key":"1835_CR38","doi-asserted-by":"publisher","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"MEJ Newman","year":"2006","unstructured":"Newman MEJ (2006) Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 74(3):036104","journal-title":"Phys. Rev. E"},{"key":"1835_CR39","unstructured":"Newman M. E. J. (Apr. 2013) Network data http:\/\/www-personal.umich.edu\/~mejn\/netdata\/"},{"key":"1835_CR40","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: An Introduction","author":"MEJ Newman","year":"2010","unstructured":"Newman MEJ (2010) Networks: An Introduction. Oxford University Press, New York, NY, USA"},{"issue":"2","key":"1835_CR41","doi-asserted-by":"publisher","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys. Rev. E 69(2):026113","journal-title":"Phys. Rev. E"},{"key":"1835_CR42","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa F et al (2011) Scikit-learn: Machine Learning in Python. J. Mach. Learn. Res. 12:2825\u20132830","journal-title":"J. Mach. Learn. Res."},{"issue":"1\u20132","key":"1835_CR43","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0012-365X(89)90214-8","volume":"74","author":"AD Petford","year":"1989","unstructured":"Petford AD, Welsh DJA (1989) A randomised 3-colouring algorithm. Discrete Math. 74(1\u20132):253\u2013261","journal-title":"Discrete Math."},{"issue":"2","key":"1835_CR44","doi-asserted-by":"publisher","first-page":"191","DOI":"10.7155\/jgaa.00124","volume":"10","author":"P Pons","year":"2006","unstructured":"Pons P, Latapy M (2006) Computing communities in large networks using random walks. J. Graph Algorithms Appl. 10(2):191\u2013218","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"1835_CR45","doi-asserted-by":"publisher","first-page":"036106","DOI":"10.1103\/PhysRevE.76.036106","volume":"76","author":"UN Raghavan","year":"2007","unstructured":"Raghavan UN, Albert R, Kumara S (2007) Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E 76(3):036106","journal-title":"Phys. Rev. E"},{"issue":"336","key":"1835_CR46","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","volume":"66","author":"WM Rand","year":"1971","unstructured":"Rand WM (1971) Objective criteria for the evaluation of clustering methods. J. Am. Stat. Assoc. 66(336):846\u2013850","journal-title":"J. Am. Stat. Assoc."},{"issue":"1","key":"1835_CR47","doi-asserted-by":"publisher","first-page":"016110","DOI":"10.1103\/PhysRevE.74.016110","volume":"74","author":"J Reichardt","year":"2006","unstructured":"Reichardt J, Bornholdt S (2006) Statistical mechanics of community detection. Phys. Rev. E 74(1):016110","journal-title":"Phys. Rev. E"},{"issue":"1","key":"1835_CR48","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1140\/epjst\/e2010-01179-1","volume":"178","author":"M Rosvall","year":"2009","unstructured":"Rosvall M, Axelsson D, Bergstrom CT (2009) The map equation. The European Physical Journal Special Topics 178(1):13\u201323","journal-title":"The European Physical Journal Special Topics"},{"issue":"4","key":"1835_CR49","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1073\/pnas.0706851105","volume":"105","author":"M Rosvall","year":"2008","unstructured":"Rosvall M, Bergstrom CT (2008) Maps of random walks on complex networks reveal community structure. Proc. Natl. Acad. Sci. U.S.A. 105(4):1118\u20131123","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"issue":"1","key":"1835_CR50","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"SE Schaeffer","year":"2007","unstructured":"Schaeffer SE (2007) Graph clustering. Comput. Sci. Rev. 1(1):27\u201364","journal-title":"Comput. Sci. Rev."},{"issue":"2","key":"1835_CR51","doi-asserted-by":"publisher","first-page":"e32210","DOI":"10.1371\/journal.pone.0032210","volume":"7","author":"MT Schaub","year":"2012","unstructured":"Schaub MT, Delvenne J-C, Yaliraki SN, Barahona M (2012) Markov Dynamics as a Zooming Lens for Multiscale Community Detection: Non Clique-Like Communities and the Field-of-View Limit. PLoS One 7(2):e32210","journal-title":"PLoS One"},{"key":"1835_CR52","unstructured":"Shawe-Taylor J, \u017derovnik J (2001) Adapting temperature for some randomized local search algorithms in Advances in scientific computing, computational intelligence and applications (eds Mastorakis, N., Mladenov, V. M. & Suter, B.) 82-87 (WSES Press, Danvers, MA, USA)"},{"issue":"4","key":"1835_CR53","first-page":"329","volume":"2","author":"J Shawe-Taylor","year":"1995","unstructured":"Shawe-Taylor J, \u017derovnik J (1995) Analysis of the Mean Field Annealing Algorithm for Graph Colouring. J. Artif. Neural Networks 2(4):329\u2013340","journal-title":"J. Artif. Neural Networks"},{"key":"1835_CR54","unstructured":"Shawe-Taylor J, \u017derovnik J. (1992) Boltzmann Machines with Finite Alphabet in Artificial Neural Networks, 2 Proceedings of the 1992 International Conference on Artificial Neural Networks (ICANN-92) (eds Aleksander, I. & Taylor, J.) 1 (Brighton, UK), 391-394"},{"key":"1835_CR55","doi-asserted-by":"crossref","unstructured":"\u0160ubelj L, Bajec M (2013) Model of complex networks based on citation dynamics in Proceedings of the 22nd International Conference on World Wide Web (ACM), 527-530","DOI":"10.1145\/2487788.2487987"},{"issue":"3","key":"1835_CR56","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1140\/epjb\/e2011-10979-2","volume":"81","author":"L \u0160ubelj","year":"2011","unstructured":"\u0160ubelj L, Bajec M (2011) Robust network community detection using balanced propagation. Eur. Phys. J. B 81(3):353\u2013362","journal-title":"Eur. Phys. J. B"},{"issue":"19\u201320","key":"1835_CR57","doi-asserted-by":"publisher","first-page":"4982","DOI":"10.1016\/j.physa.2008.04.024","volume":"387","author":"G Tib\u00e9ly","year":"2008","unstructured":"Tib\u00e9ly G, Kert\u00e9sz J (2008) On the equivalence of the label propagation method of community detection and a Potts model approach. Physica A 387(19\u201320):4982\u20134984","journal-title":"Physica A"},{"issue":"3","key":"1835_CR58","doi-asserted-by":"publisher","first-page":"036115","DOI":"10.1103\/PhysRevE.80.036115","volume":"80","author":"VA Traag","year":"2009","unstructured":"Traag VA, Bruggeman J (2009) Community detection in networks with positive and negative links. Phys. Rev. E 80(3):036115","journal-title":"Phys. Rev. E"},{"key":"1835_CR59","first-page":"2837","volume":"11","author":"NX Vinh","year":"2010","unstructured":"Vinh NX, Epps J, Bailey J (2010) Information Theoretic Measures for Clusterings Comparison: Variants, Properties, Normalization and Correction for Chance. J. Mach. Learn. Res. 11:2837\u20132854","journal-title":"J. Mach. Learn. Res."},{"issue":"11","key":"1835_CR60","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1038\/nmeth.3583","volume":"12","author":"C Wiwie","year":"2015","unstructured":"Wiwie C, Baumbach J, R\u00f6ttger R (2015) Comparing the performance of biomedical clustering methods. Nat. Methods 12(11):1033\u20131038","journal-title":"Nat. Methods"},{"key":"1835_CR61","doi-asserted-by":"publisher","first-page":"30750","DOI":"10.1038\/srep30750","volume":"6","author":"Z Yang","year":"2016","unstructured":"Yang Z, Algesheimer R, Tessone CJ (2016) A comparative analysis of community detection algorithms on artificial networks. Sci. Rep. 6:30750","journal-title":"Sci. Rep."},{"issue":"4","key":"1835_CR62","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"33","author":"WW Zachary","year":"1977","unstructured":"Zachary WW (1977) An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33(4):452\u2013473","journal-title":"J. Anthropol. Res."},{"issue":"1\u20133","key":"1835_CR63","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/0012-365X(94)90402-2","volume":"131","author":"J \u017derovnik","year":"1994","unstructured":"\u017derovnik J (1994) A randomized algorithm for k-colorability. Discrete Math. 131(1\u20133):379\u2013393","journal-title":"Discrete Math."},{"issue":"8","key":"1835_CR64","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1016\/0167-8191(92)90035-6","volume":"18","author":"J \u017derovnik","year":"1992","unstructured":"\u017derovnik J, Kaufman M (1992) A parallel variant of a heuristical algorithm for graph coloring - Corrigendum. Parallel Comput. 18(8):897\u2013900","journal-title":"Parallel Comput."}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-022-01835-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-022-01835-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-022-01835-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T23:23:38Z","timestamp":1666308218000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-022-01835-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,20]]},"references-count":64,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["1835"],"URL":"https:\/\/doi.org\/10.1007\/s40314-022-01835-0","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2022,4,20]]},"assertion":[{"value":"4 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"None.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations of interest:"}}],"article-number":"147"}}