{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:46:14Z","timestamp":1740181574014,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,2,8]],"date-time":"2021-02-08T00:00:00Z","timestamp":1612742400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,8]],"date-time":"2021-02-08T00:00:00Z","timestamp":1612742400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004488","name":"Hrvatska Zaklada za Znanost","doi-asserted-by":"publisher","award":["6732"],"award-info":[{"award-number":["6732"]}],"id":[{"id":"10.13039\/501100004488","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s42979-021-00462-6","type":"journal-article","created":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T18:22:13Z","timestamp":1612894933000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Application of Tolerance Graphs to Combat COVID-19 Pandemic"],"prefix":"10.1007","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3299-7859","authenticated-orcid":false,"given":"Dean","family":"Crnkovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6558-5167","authenticated-orcid":false,"given":"Andrea","family":"\u0160vob","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,8]]},"reference":[{"key":"462_CR1","doi-asserted-by":"publisher","first-page":"1983","DOI":"10.1016\/j.apm.2020.08.056","volume":"89","author":"H Zhu","year":"2021","unstructured":"Zhu H, Li Y, Jin X, Huang J, Liu X, Qian Y, Tan J. Transmission dynamics and control methodology of COVID-19: a modeling study. Appl Math Model. 2021;89:1983\u201398.","journal-title":"Appl Math Model"},{"key":"462_CR2","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.matcom.2020.09.029","volume":"181","author":"O Postavaru","year":"2021","unstructured":"Postavaru O, Anton SR, Toma A. COVID-19 pandemic and chaos theory. Math Comput Simul. 2021;181:138\u201349.","journal-title":"Math Comput Simul"},{"key":"462_CR3","volume-title":"Graph Theory","author":"R Diestel","year":"2012","unstructured":"Diestel R. Graph Theory. New York: Springer; 2012."},{"key":"462_CR4","unstructured":"Golumbic MC, Monma CL. A generalization of interval graphs with tolerances. In: Proceedings of the thirteenth Southeastern conference on combinatorics, graph theory and computing (Boca Raton, Fla., 1982), Congr. Numer., vol., 35; 1982. pp. 321\u201331."},{"key":"462_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511542985","volume-title":"Tolerance graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic MC, Trenk AN. Tolerance graphs. Cambridge: Cambridge University Press; 2004."},{"key":"462_CR6","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1002\/jgt.20163","volume":"52","author":"MC Golumbic","year":"2006","unstructured":"Golumbic MC, Jamison RE. Rank-tolerance graph classes. J Graph Theory. 2006;52:317\u201340.","journal-title":"J Graph Theory"},{"key":"462_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0095-8956(72)90045-7","volume":"13","author":"L Lov\u00e1sz","year":"1972","unstructured":"Lov\u00e1sz L. A characterization of perfect graphs. J Combin Theory B. 1972;13:95\u20138.","journal-title":"J Combin Theory B"},{"key":"462_CR8","doi-asserted-by":"publisher","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M Chudnovsky","year":"2006","unstructured":"Chudnovsky M, Robertson N, Seymour P, Thomas R. The strong perfect graph theorem. Ann Math. 2006;164:51\u2013229.","journal-title":"Ann Math"},{"key":"462_CR9","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations","author":"RM Karp","year":"1972","unstructured":"Karp RM. Reducibility among combinatorial problems. In: Miller RE, Thatcher JW, editors. Complexity of computer computations. New York: Plenum Press; 1972. p. 85\u2013103."},{"key":"462_CR10","first-page":"325","volume":"21","author":"M Gr\u00f6tschel","year":"1984","unstructured":"Gr\u00f6tschel M, Lov\u00e1sz L, Schrijver A. Polynomial algorithms for perfect graphs. Ann Discr Math. 1984;21:325\u201356.","journal-title":"Ann Discr Math"},{"key":"462_CR11","volume-title":"Graphs, networks and algorithms","author":"D Jungnickel","year":"2005","unstructured":"Jungnickel D. Graphs, networks and algorithms. 2nd ed. Berlin, Heidelberg, New York: Springer; 2005.","edition":"2"},{"key":"462_CR12","unstructured":"Python Software Foundation. Python Language Reference, version 3.9. 2020. http:\/\/www.python.org."},{"key":"462_CR13","unstructured":"Developers TS. Sage Mathematics Software (version 7.3). 2016. http:\/\/www.sagemath.org"},{"key":"462_CR14","unstructured":"Niskanen S,\u00d6sterg\u00e5rd PRJ. Cliquer user\u2019s guide, version 1.0, Communications Laboratory, Helsinki University of Technology, Espoo, Finland, Tech.Rep. T48; 2003."}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-021-00462-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s42979-021-00462-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-021-00462-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,31]],"date-time":"2021-03-31T18:32:42Z","timestamp":1617215562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s42979-021-00462-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,8]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["462"],"URL":"https:\/\/doi.org\/10.1007\/s42979-021-00462-6","relation":{},"ISSN":["2662-995X","2661-8907"],"issn-type":[{"type":"print","value":"2662-995X"},{"type":"electronic","value":"2661-8907"}],"subject":[],"published":{"date-parts":[[2021,2,8]]},"assertion":[{"value":"27 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}],"article-number":"83"}}