{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:50:13Z","timestamp":1782971413460,"version":"3.54.5"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031248474","type":"print"},{"value":"9783031248481","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-24848-1_6","type":"book-chapter","created":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T15:08:33Z","timestamp":1673190513000},"page":"84-97","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Fault-Tolerant Graph Realizations in\u00a0the\u00a0Congested Clique, Revisited"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0414-7910","authenticated-orcid":false,"given":"Manish","family":"Kumar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,1,8]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., et al.: Communication complexity of Byzantine agreement, revisited. In: PODC, pp. 317\u2013326 (2019)","DOI":"10.1145\/3293611.3331629"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Shah, G.: Skip graphs. ACM Trans. Algorithms 3(4), 37\u2013es (2007)","DOI":"10.1145\/1290672.1290674"},{"issue":"6","key":"6_CR3","doi-asserted-by":"publisher","first-page":"1321","DOI":"10.1109\/TPDS.2021.3104239","volume":"33","author":"J Augustine","year":"2022","unstructured":"Augustine, J., Choudhary, K., Cohen, A., Peleg, D., Sivasubramaniam, S., Sourav, S.: Distributed graph realizations. IEEE Trans. Parallel Distrib. Syst. 33(6), 1321\u20131337 (2022)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Augustine, J., Molla, A.R., Pandurangan, G.: Sublinear message bounds for randomized agreement. In: Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), pp. 315\u2013324 (2018)","DOI":"10.1145\/3212734.3212751"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Augustine, J., Sivasubramaniam, S.: Spartan: a framework for sparse robust addressable networks. In: 2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 1060\u20131069. IEEE (2018)","DOI":"10.1109\/IPDPS.2018.00115"},{"issue":"6","key":"6_CR6","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1007\/s00224-006-1349-0","volume":"39","author":"A Bagchi","year":"2006","unstructured":"Bagchi, A., Bhargava, A., Chaudhary, A., Eppstein, D., Scheideler, C.: The effect of faults on network expansion. Theory Comput. Syst. 39(6), 903\u2013928 (2006)","journal-title":"Theory Comput. Syst."},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-319-90530-3_5","volume-title":"Computer Science \u2013 Theory and Applications","author":"L Barenboim","year":"2018","unstructured":"Barenboim, L., Khazanov, V.: Distributed symmetry-breaking algorithms for congested cliques. In: Fomin, F.V., Podolskii, V.V. (eds.) CSR 2018. LNCS, vol. 10846, pp. 41\u201352. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-90530-3_5"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-319-77404-6_11","volume-title":"LATIN 2018: Theoretical Informatics","author":"F Becker","year":"2018","unstructured":"Becker, F., Montealegre, P., Rapaport, I., Todinca, I.: The impact of locality on the detection of cycles in the broadcast congested clique model. In: Bender, M.A., Farach-Colton, M., Mosteiro, M.A. (eds.) LATIN 2018. LNCS, vol. 10807, pp. 134\u2013145. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77404-6_11"},{"issue":"3","key":"6_CR9","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0012-365X(76)90098-4","volume":"16","author":"M Behzad","year":"1976","unstructured":"Behzad, M., Simpson, J.E.: Eccentric sequences and eccentric sets in graphs. Discret. Math. 16(3), 187\u2013193 (1976)","journal-title":"Discret. Math."},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Pavlov, E., Vaikuntanathan, V.: Byzantine agreement in the full-information model in o(log n) rounds. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp. 179\u2013186. ACM (2006)","DOI":"10.1145\/1132516.1132543"},{"issue":"6","key":"6_CR11","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/s00446-020-00380-5","volume":"34","author":"K Censor-Hillel","year":"2021","unstructured":"Censor-Hillel, K., Dory, M., Korhonen, J.H., Leitersdorf, D.: Fast approximate shortest paths in the congested clique. Distrib. Comput. 34(6), 463\u2013487 (2021)","journal-title":"Distrib. Comput."},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-33651-5_14","volume-title":"Distributed Computing","author":"D Dolev","year":"2012","unstructured":"Dolev, D., Lenzen, C., Peled, S.: \u201cTri, tri again\u2019\u2019: finding triangles and small subgraphs in a distributed setting. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 195\u2013209. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33651-5_14"},{"key":"6_CR13","unstructured":"Dolev, D., Strong, H.R.: Requirements for agreement in a distributed system. In: Proceedings of the Second International Symposium on Distributed Data Bases, pp. 115\u2013129. North-Holland Publishing Company (1982)"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Drucker, A., Kuhn, F., Oshman, R.: On the power of the congested clique model. In: Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing, pp. 367\u2013376 (2014)","DOI":"10.1145\/2611462.2611493"},{"key":"6_CR15","first-page":"264","volume":"11","author":"P Erd\u00f6s","year":"1960","unstructured":"Erd\u00f6s, P., Gallai, T.: Graphs with prescribed degrees of vertices (in Hungarian). Mat. Lapok (N.S.) 11, 264\u2013274 (1960)","journal-title":"Mat. Lapok (N.S.)"},{"issue":"4","key":"6_CR16","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539790187084","volume":"26","author":"P Feldman","year":"1997","unstructured":"Feldman, P., Micali, S.: An optimal probabilistic protocol for synchronous Byzantine agreement. SIAM J. Comput. 26(4), 873\u2013933 (1997)","journal-title":"SIAM J. Comput."},{"key":"6_CR17","unstructured":"Fiat, A., Saia, J.: Censorship resistant peer-to-peer content addressable networks. In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 94\u2013103. Society for Industrial and Applied Mathematics (2002)"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1137\/0405003","volume":"5","author":"A Frank","year":"1992","unstructured":"Frank, A.: Augmenting graphs to meet edge-connectivity requirements. SIAM J. Discrete Math. 5, 25\u201343 (1992)","journal-title":"SIAM J. Discrete Math."},{"key":"6_CR19","unstructured":"Frank, A.: Connectivity augmentation problems in network design. In: Mathematical Programming: State of the Art, pp. 34\u201363. Univ. Michigan (1994)"},{"issue":"4","key":"6_CR20","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1109\/TCT.1970.1083185","volume":"17","author":"H Frank","year":"1970","unstructured":"Frank, H., Chou, W.: Connectivity considerations in the design of survivable networks. IEEE Trans. Circuit Theory 17(4), 486\u2013490 (1970)","journal-title":"IEEE Trans. Circuit Theory"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Galil, Z., Mayer, A.J., Yung, M.: Resolving message complexity of Byzantine agreement and beyond. In: 36th Annual Symposium on Foundations of Computer Science, pp. 724\u2013733. IEEE Computer Society (1995)","DOI":"10.1109\/SFCS.1995.492674"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Nowicki, K.: Congested clique algorithms for the minimum cut problem. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing (PODC), pp. 357\u2013366 (2018)","DOI":"10.1145\/3212734.3212750"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Parter, M.: MST in log-star rounds of congested clique. In: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (PODC), pp. 19\u201328 (2016)","DOI":"10.1145\/2933057.2933103"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Gilbert, S., Kowalski, D.R.: Distributed agreement with optimal communication complexity. In: SODA, pp. 965\u2013977 (2010)","DOI":"10.1137\/1.9781611973075.78"},{"issue":"4","key":"6_CR25","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"R Gomory","year":"1961","unstructured":"Gomory, R., Hu, T.: Multi-terminal network flows. J. Soc. Ind. Appl. Math. 9(4), 551\u2013570 (1961)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"3","key":"6_CR26","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1137\/0110037","volume":"10","author":"SL Hakimi","year":"1962","unstructured":"Hakimi, S.L.: On realizability of a set of integers as degrees of the vertices of a linear graph - I. SIAM J. Appl. Math. 10(3), 496\u2013506 (1962)","journal-title":"SIAM J. Appl. Math."},{"key":"6_CR27","doi-asserted-by":"publisher","first-page":"477","DOI":"10.21136\/CPM.1955.108220","volume":"80","author":"V Havel","year":"1955","unstructured":"Havel, V.: A remark on the existence of finite graphs. Casopis Pest. Mat. 80, 477\u2013480 (1955)","journal-title":"Casopis Pest. Mat."},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-030-01325-7_28","volume-title":"Structural Information and Communication Complexity","author":"T Jurdzi\u0144ski","year":"2018","unstructured":"Jurdzi\u0144ski, T., Nowicki, K.: Connectivity and minimum cut approximation in the broadcast congested clique. In: Lotker, Z., Patt-Shamir, B. (eds.) SIROCCO 2018. LNCS, vol. 11085, pp. 331\u2013344. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01325-7_28"},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"Jurdzi\u0144ski, T., Nowicki, K.: MST in $$O(1)$$ rounds of congested clique. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2620\u20132632 (2018)","DOI":"10.1137\/1.9781611975031.167"},{"key":"6_CR30","unstructured":"Kapron, B.M., Kempe, D., King, V., Saia, J., Sanwalani, V.: Fast asynchronous Byzantine agreement and leader election with full information. In: SODA, pp. 1038\u20131047. SIAM (2008)"},{"issue":"2","key":"6_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2837019","volume":"63","author":"V King","year":"2016","unstructured":"King, V., Saia, J.: Byzantine agreement in expected polynomial time. J. ACM 63(2), 1\u201321 (2016)","journal-title":"J. ACM"},{"key":"6_CR32","unstructured":"Konrad, C.: MIS in the congested clique model in $$\\log \\log {\\Delta }$$ rounds. arXiv preprint arXiv:1802.07647 (2018)"},{"key":"6_CR33","doi-asserted-by":"crossref","unstructured":"Korhonen, J.H., Suomela, J.: Towards a complexity theory for the congested clique. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, pp. 163\u2013172. SPAA 2018, ACM, New York (2018)","DOI":"10.1145\/3210377.3210391"},{"key":"6_CR34","doi-asserted-by":"crossref","unstructured":"Kumar, M., Molla, A.R.: Brief announcement: on the message complexity of fault-tolerant computation: leader election and agreement. In: PODC 2021, pp. 259\u2013262. ACM (2021)","DOI":"10.1145\/3465084.3467949"},{"key":"6_CR35","doi-asserted-by":"publisher","unstructured":"Kumar, M., Molla, A.R., Sivasubramaniam, S.: Fault-tolerant graph realizations in the congested clique. In: ALGOSENSRS (2022). https:\/\/doi.org\/10.48550\/arXiv.2208.10135","DOI":"10.48550\/arXiv.2208.10135"},{"issue":"4","key":"6_CR36","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/BF02017925","volume":"6","author":"L Lesniak","year":"1975","unstructured":"Lesniak, L.: Eccentric sequences in graphs. Period. Math. Hung. 6(4), 287\u2013293 (1975). https:\/\/doi.org\/10.1007\/BF02017925","journal-title":"Period. Math. Hung."},{"issue":"1","key":"6_CR37","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1137\/S0097539704441848","volume":"35","author":"Z Lotker","year":"2005","unstructured":"Lotker, Z., Patt-Shamir, B., Pavlov, E., Peleg, D.: Minimum-weight spanning tree construction in $$o(\\log \\log n)$$ communication rounds. SIAM J. Comput. 35(1), 120\u2013131 (2005)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"6_CR38","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1109\/COMST.2005.1610546","volume":"7","author":"EK Lua","year":"2005","unstructured":"Lua, E.K., Crowcroft, J., Pias, M., Sharma, R., Lim, S.: A survey and comparison of peer-to-peer overlay network schemes. IEEE Commun. Surv. Tutor. 7(2), 72\u201393 (2005)","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"6_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jnca.2015.04.014","volume":"55","author":"A Malatras","year":"2015","unstructured":"Malatras, A.: State-of-the-art survey on P2P overlay networks in pervasive computing environments. J. Netw. Comput. Appl. 55, 1\u201323 (2015)","journal-title":"J. Netw. Comput. Appl."},{"key":"6_CR40","doi-asserted-by":"crossref","unstructured":"Patt-Shamir, B., Teplitsky, M.: The round complexity of distributed sorting. In: Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 249\u2013256 (2011)","DOI":"10.1145\/1993806.1993851"},{"key":"6_CR41","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distributed Computing: A Locality Sensitive Approach. SIAM (2000)","DOI":"10.1137\/1.9780898719772"},{"key":"6_CR42","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R.M., Shenker, S.: A scalable content-addressable network. In: SIGCOMM, pp. 161\u2013172. ACM (2001)","DOI":"10.1145\/964723.383072"},{"issue":"1","key":"6_CR43","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/TNET.2002.808407","volume":"11","author":"I Stoica","year":"2003","unstructured":"Stoica, I., et al.: Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE ACM Trans. Netw. 11(1), 17\u201332 (2003)","journal-title":"IEEE ACM Trans. Netw."},{"key":"6_CR44","doi-asserted-by":"crossref","unstructured":"Upfal, E.: Tolerating linear number of faults in networks of bounded degree. In: Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, pp. 83\u201389. PODC 1992, ACM, New York (1992)","DOI":"10.1145\/135419.135437"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Intelligent Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-24848-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T20:34:12Z","timestamp":1728678852000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-24848-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031248474","9783031248481"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-24848-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"8 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICDCIT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Distributed Computing and Intelligent Technology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bhubaneswar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 January 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 January 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icdcit2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icdcit.ac.in\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"55","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":"20","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":"9","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":"36% - 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.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":"3","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}