{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T15:59:15Z","timestamp":1782835155171,"version":"3.54.5"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100018818","name":"National Research, Development and Innovation Fund of Hungary, financed through the FK_20 and K_23 funding schemes","doi-asserted-by":"publisher","award":["134604"],"award-info":[{"award-number":["134604"]}],"id":[{"id":"10.13039\/501100018818","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100018818","name":"National Research, Development and Innovation Fund of Hungary, financed through the FK_20 and K_23 funding schemes","doi-asserted-by":"publisher","award":["146347"],"award-info":[{"award-number":["146347"]}],"id":[{"id":"10.13039\/501100018818","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Hungarian National Research, Development and Innovation Office (NRDI) Office within the Artificial Intelligence National Laboratory Program Framework"},{"name":"NRDI through the Program of Excellence at Budapest University of Technology and Economics","award":["TKP2021-NVA-02"],"award-info":[{"award-number":["TKP2021-NVA-02"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Select. Areas Commun."],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1109\/jsac.2025.3528812","type":"journal-article","created":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T19:58:13Z","timestamp":1736798293000},"page":"484-494","source":"Crossref","is-referenced-by-count":3,"title":["Connectivity Preserving Graph Sequences for Routing Arborescence Construction"],"prefix":"10.1109","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3512-9504","authenticated-orcid":false,"given":"J\u00e1nos","family":"Tapolcai","sequence":"first","affiliation":[{"name":"Department of Telecommunications and Artificial Intelligence, Faculty of Electrical Engineering and Informatics, MTA-BME Information Systems Research Group, Budapest University of Technology and Economics, Budapest, Hungary"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1644-2172","authenticated-orcid":false,"given":"P\u00e9ter","family":"Babarczi","sequence":"additional","affiliation":[{"name":"Department of Telecommunications and Artificial Intelligence, Faculty of Electrical Engineering and Informatics, MTA-BME Information Systems Research Group, Budapest University of Technology and Economics, Budapest, Hungary"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bal\u00e1zs","family":"Br\u00e1nyi","sequence":"additional","affiliation":[{"name":"Department of Telecommunications and Artificial Intelligence, Faculty of Electrical Engineering and Informatics, MTA-BME Information Systems Research Group, Budapest University of Technology and Economics, Budapest, Hungary"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0717-1481","authenticated-orcid":false,"given":"Pin-Han","family":"Ho","sequence":"additional","affiliation":[{"name":"Shenzhen Institute for Advanced Study, University of Electronic Science and Technology of China (UESTC), Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8364-9627","authenticated-orcid":false,"given":"Lajos","family":"R\u00f3nyai","sequence":"additional","affiliation":[{"name":"HUN-REN Institute for Computer Science and Control, Department of Algebra and Geometry, Institute of Mathematics, Budapest University of Technology and Economics, Budapest, Hungary"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.902727"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN.2008.ECP.78"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-44685-7"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2021.3070100"},{"key":"ref5","volume-title":"Shaping Europe\u2019s Digital Future, Actors in the Broadband Value Chain","year":"2019"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1764873.1764885"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018477"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM42981.2021.9488782"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524552"},{"key":"ref10","first-page":"15","article-title":"On the resiliency of randomized routing against multiple edge failures","volume-title":"Proc. Int. Colloq. Automata, Lang., Program. (ICALP)","author":"Chiesa"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2021.3063980"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332478"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976489.5"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/DRCN.2005.1563848"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(75)90058-8"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70504-1"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1201\/b19163-22"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/090746495"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00465-1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1022"},{"key":"ref21","first-page":"455","article-title":"Fast edge splitting and Edmonds\u2019 arborescence construction for unweighted graphs","volume-title":"Proc. ACM-SIAM Symp. Discrete Algorithms","author":"Bhalgat"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195436"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13036-6_8"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1090\/chel\/361"},{"key":"ref25","volume-title":"Connections in Combinatorial Optimization","volume":"38","author":"Frank","year":"2011"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/0109047"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250879"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2342155"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1002\/net.20371"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.111002"}],"container-title":["IEEE Journal on Selected Areas in Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/49\/10893724\/10839021.pdf?arnumber=10839021","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T20:26:22Z","timestamp":1740083182000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10839021\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2]]},"references-count":30,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/jsac.2025.3528812","relation":{},"ISSN":["0733-8716","1558-0008"],"issn-type":[{"value":"0733-8716","type":"print"},{"value":"1558-0008","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2]]}}}