{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T15:59:18Z","timestamp":1782835158383,"version":"3.54.5"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T00:00:00Z","timestamp":1684281600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T00:00:00Z","timestamp":1684281600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100017413","name":"Innovation Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100017413","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,5,17]]},"DOI":"10.1109\/infocom53939.2023.10229023","type":"proceedings-article","created":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T17:40:43Z","timestamp":1693330843000},"page":"1-10","source":"Crossref","is-referenced-by-count":2,"title":["Resilient Routing Table Computation Based on Connectivity Preserving Graph Sequences"],"prefix":"10.1109","author":[{"given":"J\u00e1nos","family":"Tapolcai","sequence":"first","affiliation":[{"name":"Budapest University of Technology and Economics,Faculty of Electrical Engineering and Informatics,Department of Telecommunications and Media Informatics,Budapest,Hungary,H-1111"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"P\u00e9ter","family":"Babarczi","sequence":"additional","affiliation":[{"name":"Budapest University of Technology and Economics,Faculty of Electrical Engineering and Informatics,Department of Telecommunications and Media Informatics,Budapest,Hungary,H-1111"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pin-Han","family":"Ho","sequence":"additional","affiliation":[{"name":"University of Waterloo,Deptartment of Electrical and Computer Engineering,Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lajos","family":"R\u00f3nyai","sequence":"additional","affiliation":[{"name":"Institute for Computer Science and Control,Eötvös Loránd Research Network; and Department of Algebra"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976489.5"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332478"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(75)90058-8"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/DRCN.2005.1563848"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2021.3063980"},{"key":"ref10","article-title":"On the resiliency of randomized routing against multiple edge failures","author":"chiesa","year":"2016","journal-title":"Proc 29th Int Colloquium Automata Languages Program (ICALP)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN.2008.ECP.78"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.902727"},{"key":"ref17","first-page":"313","article-title":"Graph connectivity augmentation","author":"frank","year":"2015","journal-title":"Handbook of Graph Theory Combinatorial Optimization and Algorithms"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0167-5060(08)70504-1","article-title":"A reduction method for edge-connectivity in graphs","volume":"3","author":"mader","year":"1978","journal-title":"Annals of Discrete Mathematics"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00465-1"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/090746495"},{"key":"ref24","volume":"361","author":"lov\u00e1sz","year":"1993","journal-title":"Combinatorial Problems and Exercises"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13036-6_8"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/0109047"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(92)90589-8"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1022"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195436"},{"key":"ref21","first-page":"455","article-title":"Fast edge splitting and Edmonds’ arborescence construction for unweighted graphs","author":"bhalgat","year":"2008","journal-title":"Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref28","article-title":"SNDlib 1.0– Survivable Network Design Library","author":"orlowski","year":"2007","journal-title":"Proc INOC"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250879"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.111002"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM42981.2021.9488782"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018477"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524552"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2021.3070100"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-44685-7"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1764873.1764885"},{"key":"ref5","article-title":"Shaping Europe’s digital future, Actors in the broadband value chain","year":"2019","journal-title":"European Commission"}],"event":{"name":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications","location":"New York City, NY, USA","start":{"date-parts":[[2023,5,17]]},"end":{"date-parts":[[2023,5,20]]}},"container-title":["IEEE INFOCOM 2023 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10228851\/10228852\/10229023.pdf?arnumber=10229023","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,18]],"date-time":"2023-09-18T17:44:24Z","timestamp":1695059064000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10229023\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,17]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/infocom53939.2023.10229023","relation":{},"subject":[],"published":{"date-parts":[[2023,5,17]]}}}