{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:24:29Z","timestamp":1743096269241,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030648428"},{"type":"electronic","value":"9783030648435"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-64843-5_7","type":"book-chapter","created":{"date-parts":[[2020,12,4]],"date-time":"2020-12-04T16:04:24Z","timestamp":1607097864000},"page":"91-104","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Approximation of the Zero Error Capacity by a Greedy Algorithm"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9165-3028","authenticated-orcid":false,"given":"Marcin","family":"Jurkiewicz","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,4]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-81-322-1599-8","volume-title":"Basic Modern Algebra with Applications","author":"MR Adhikari","year":"2014","unstructured":"Adhikari, M.R., Adhikari, A.: Basic Modern Algebra with Applications. Springer, New Delhi (2014). https:\/\/doi.org\/10.1007\/978-81-322-1599-8"},{"issue":"1\u20132","key":"7_CR2","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.ipl.2011.10.011","volume":"112","author":"MD Barrus","year":"2012","unstructured":"Barrus, M.D.: Havel-Hakimi residues of unigraphs. Inform. Process. Lett. 112(1\u20132), 44\u201348 (2012). https:\/\/doi.org\/10.1016\/j.ipl.2011.10.011","journal-title":"Inform. Process. Lett."},{"key":"7_CR3","unstructured":"Baumert, L.D., McEliece, R.J., Rodemich, E., Rumsey, Jr., H.C., Stanley, R., Taylor, H.: A combinatorial packing problem. In: Computers in algebra and number theory (Proceedings of SIAM-AMS Symposium on Applied Mathematics, New York, 1970), SIAM-AMS Proceedings, vol. IV, pp. 97\u2013108. American Mathematical Society, Providence (1971)"},{"key":"7_CR4","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-319-07401-6_24","volume-title":"Nostradamus 2014: Prediction, Modeling and Analysis of Complex Systems","author":"D Chalupa","year":"2014","unstructured":"Chalupa, D., Posp\u00edchal, J.: On the growth of large independent sets in scale-free networks. In: Zelinka, I., Suganthan, P.N., Chen, G., Snasel, V., Abraham, A., R\u00f6ssler, O. (eds.) Nostradamus 2014: Prediction, Modeling and Analysis of Complex Systems. AISC, vol. 289, pp. 251\u2013260. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07401-6_24"},{"key":"7_CR5","first-page":"243","volume":"66","author":"B Codenotti","year":"2003","unstructured":"Codenotti, B., Gerace, I., Resta, G.: Some remarks on the Shannon capacity of odd cycles. Ars Combin. 66, 243\u2013257 (2003)","journal-title":"Ars Combin."},{"key":"7_CR6","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"key":"7_CR7","series-title":"Wiley-Interscience","volume-title":"Elements of Information Theory","author":"TM Cover","year":"2006","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley-Interscience, 2nd edn. Wiley, Hoboken (2006)","edition":"2"},{"key":"7_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889","volume-title":"Information Theory","author":"I Csisz\u00e1r","year":"2011","unstructured":"Csisz\u00e1r, I., K\u00f6rner, J.: Information Theory, 2nd edn. Cambridge University Press, Cambridge (2011). https:\/\/doi.org\/10.1017\/CBO9780511921889. Coding theorems for discrete memoryless systems","edition":"2"},{"issue":"1","key":"7_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1002\/jgt.3190150107","volume":"15","author":"O Favaron","year":"1991","unstructured":"Favaron, O., Mah\u00e9o, M., Sacl\u00e9, J.F.: On the residue of a graph. J. Graph Theory 15(1), 39\u201364 (1991). https:\/\/doi.org\/10.1002\/jgt.3190150107","journal-title":"J. Graph Theory"},{"issue":"1\u20133","key":"7_CR10","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0012-365X(93)90156-N","volume":"111","author":"O Favaron","year":"1993","unstructured":"Favaron, O., Mah\u00e9o, M., Sacl\u00e9, J.F.: Some eigenvalue properties in graphs (conjectures of Graffiti. II). Discrete Math. 111(1\u20133), 197\u2013220 (1993). https:\/\/doi.org\/10.1016\/0012-365X(93)90156-N. Graph theory and combinatorics (Marseille-Luminy, 1990)","journal-title":"Discrete Math."},{"key":"7_CR11","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16533-7","volume-title":"Exact Exponential Algorithms","author":"FV Fomin","year":"2010","unstructured":"Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16533-7"},{"key":"7_CR12","unstructured":"Fowler, P.W., Manolopoulos, D.: An Atlas of Fullerenes. Courier Corporation (2007)"},{"issue":"1","key":"7_CR13","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.cplett.2007.09.054","volume":"448","author":"P Fowler","year":"2007","unstructured":"Fowler, P., Daugherty, S., Myrvold, W.: Independence number and fullerene stability. Chem. Phys. Lett. 448(1), 75\u201382 (2007). https:\/\/doi.org\/10.1016\/j.cplett.2007.09.054. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0009261407012948","journal-title":"Chem. Phys. Lett."},{"key":"7_CR14","series-title":"Discrete Mathematics and its Applications","volume-title":"Handbook of Graph Theory","year":"2014","unstructured":"Gross, J.L., Yellen, J., Zhang, P. (eds.): Handbook of Graph Theory. Discrete Mathematics and its Applications, 2nd edn. CRC Press, Boca Raton (2014)","edition":"2"},{"issue":"5","key":"7_CR15","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1016\/j.jctb.2012.06.001","volume":"102","author":"A Gy\u00e1rf\u00e1s","year":"2012","unstructured":"Gy\u00e1rf\u00e1s, A., Seb\u0151, A., Trotignon, N.: The chromatic gap and its extremes. J. Combin. Theory Ser. B 102(5), 1155\u20131178 (2012). https:\/\/doi.org\/10.1016\/j.jctb.2012.06.001","journal-title":"J. Combin. Theory Ser. B"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/0095-8956(73)90014-2","volume":"15","author":"RS Hales","year":"1973","unstructured":"Hales, R.S.: Numerical invariants and the strong product of graphs. J. Combin. Theory Ser. B 15, 146\u2013155 (1973)","journal-title":"J. Combin. Theory Ser. B"},{"key":"7_CR17","series-title":"Discrete Mathematics and its Applications","doi-asserted-by":"publisher","DOI":"10.1201\/b10959","volume-title":"Handbook of Product Graphs","author":"R Hammack","year":"2011","unstructured":"Hammack, R., Imrich, W., Klav\u017ear, S.: Handbook of Product Graphs. Discrete Mathematics and its Applications. CRC Press, Boca Raton (2011). With a foreword by Peter Winkler"},{"issue":"1\u20133","key":"7_CR18","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0012-365X(00)00298-3","volume":"232","author":"J Harant","year":"2001","unstructured":"Harant, J., Schiermeyer, I.: On the independence number of a graph in terms of order and size. Discrete Math. 232(1\u20133), 131\u2013138 (2001). https:\/\/doi.org\/10.1016\/S0012-365X(00)00298-3","journal-title":"Discrete Math."},{"key":"7_CR19","unstructured":"Jurkiewicz, M.: A generalization of the Shannon\u2019s theorem and its application to complex networks. preprint"},{"key":"7_CR20","unstructured":"Jurkiewicz, M.: Relevant measures of product networks. preprint"},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.amc.2017.06.025","volume":"315","author":"M Jurkiewicz","year":"2017","unstructured":"Jurkiewicz, M.: Average distance is submultiplicative and subadditive with respect to the strong product of graphs. Appl. Math. Comput. 315, 278\u2013285 (2017). https:\/\/doi.org\/10.1016\/j.amc.2017.06.025","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"7_CR22","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1515\/fcds-2015-0009","volume":"40","author":"M Jurkiewicz","year":"2015","unstructured":"Jurkiewicz, M., Kubale, M., Ocetkiewicz, K.: On the independence number of some strong products of cycle-powers. Found. Comput. Decis. Sci. 40(2), 133\u2013141 (2015). https:\/\/doi.org\/10.1515\/fcds-2015-0009","journal-title":"Found. Comput. Decis. Sci."},{"key":"7_CR23","unstructured":"Jurkiewicz, M., Pikies, T.: Selected topics in modern mathematics. Chap. Some classical lower bounds on the independence number and their behavior on the strong product of graphs. Publishing House AKAPIT, Krak\u00f3w, inst. Politechnika Krakowska (2015)"},{"issue":"6","key":"7_CR24","doi-asserted-by":"publisher","first-page":"2207","DOI":"10.1109\/18.720537","volume":"44","author":"J K\u00f6rner","year":"1998","unstructured":"K\u00f6rner, J., Orlitsky, A.: Zero-error information theory. IEEE Trans. Inform. Theory 44(6), 2207\u20132229 (1998). https:\/\/doi.org\/10.1109\/18.720537. Information theory: 1948-1998","journal-title":"IEEE Trans. Inform. Theory"},{"key":"7_CR25","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/352","volume-title":"Graph Colorings, Contemporary Mathematics","year":"2004","unstructured":"Kubale, M. (ed.): Graph Colorings, Contemporary Mathematics, vol. 352. American Mathematical Society, Providence (2004). https:\/\/doi.org\/10.1090\/conm\/352"},{"key":"7_CR26","first-page":"985","volume":"11","author":"J Leskovec","year":"2010","unstructured":"Leskovec, J., Chakrabarti, D., Kleinberg, J., Faloutsos, C., Ghahramani, Z.: Kronecker graphs: an approach to modeling networks. J. Mach. Learn. Res. 11, 985\u20131042 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"7_CR27","series-title":"Discrete Mathematics and its Applications","doi-asserted-by":"publisher","DOI":"10.1201\/b17376","volume-title":"Bijective Combinatorics","author":"NA Loehr","year":"2011","unstructured":"Loehr, N.A.: Bijective Combinatorics. Discrete Mathematics and its Applications. CRC Press, Boca Raton (2011)"},{"issue":"1","key":"7_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"25","author":"L Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz, L.: On the Shannon capacity of a graph. IEEE Trans. Inform. Theory 25(1), 1\u20137 (1979). https:\/\/doi.org\/10.1109\/TIT.1979.1055985. http:\/\/dx.doi.org.mathematical-reviews.han.bg.pg.edu.pl\/10.1109\/TIT.1979.1055985","journal-title":"IEEE Trans. Inform. Theory"},{"key":"7_CR29","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511819896","volume-title":"The Theory of Information and Coding, Encyclopedia of Mathematics and Its Applications","author":"RJ McEliece","year":"2004","unstructured":"McEliece, R.J.: The Theory of Information and Coding, Encyclopedia of Mathematics and Its Applications, vol. 86. Cambridge University Press, Cambridge (2004). https:\/\/doi.org\/10.1017\/CBO9780511819896. http:\/\/dx.doi.org.mathematical-reviews.han.bg.pg.edu.pl\/10.1017\/CBO9780511819896. With a foreword by Mark Kac"},{"key":"7_CR30","unstructured":"Pikies, T.: Personal communication (2015)"},{"key":"7_CR31","volume-title":"Fractional Graph Theory","author":"ER Scheinerman","year":"2011","unstructured":"Scheinerman, E.R., Ullman, D.H.: Fractional Graph Theory. Dover Publications Inc., Mineola (2011). A rational approach to the theory of graphs, With a foreword by Claude Berge, Reprint of the 1997 original"},{"issue":"September","key":"7_CR32","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/TIT.1956.1056798","volume":"IT\u20132","author":"CE Shannon","year":"1956","unstructured":"Shannon, C.E.: The zero error capacity of a noisy channel. Inst. Radio Eng. Trans. Inf. Theory IT\u20132(September), 8\u201319 (1956)","journal-title":"Inst. Radio Eng. Trans. Inf. Theory"},{"key":"7_CR33","doi-asserted-by":"publisher","unstructured":"Whang, J.J., Gleich, D.F., Dhillon, I.S.: Overlapping community detection using seed set expansion. In: Proceedings of the 22nd ACM International Conference on Information & Knowledge Management, CIKM 2013, pp. 2099\u20132108. Association for Computing Machinery, New York (2013). https:\/\/doi.org\/10.1145\/2505515.2505535","DOI":"10.1145\/2505515.2505535"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64843-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,4]],"date-time":"2020-12-04T16:48:43Z","timestamp":1607100523000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-64843-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030648428","9783030648435"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64843-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOA2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"104","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"55","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic this event was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}