{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T19:49:08Z","timestamp":1725738548483},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392115"},{"type":"electronic","value":"9783642392122"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39212-2_53","type":"book-chapter","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T13:09:19Z","timestamp":1372770559000},"page":"607-619","source":"Crossref","is-referenced-by-count":7,"title":["Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks"],"prefix":"10.1007","author":[{"given":"Monika","family":"Henzinger","sequence":"first","affiliation":[]},{"given":"Sebastian","family":"Krinninger","sequence":"additional","affiliation":[]},{"given":"Danupon","family":"Nanongkai","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Afek, Y., Awerbuch, B., Gafni, E.: Applying static network protocols to dynamic networks. In: FOCS, pp. 358\u2013370 (1987)","key":"53_CR1","DOI":"10.1109\/SFCS.1987.7"},{"issue":"1","key":"53_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/227595.227596","volume":"43","author":"Y. Afek","year":"1996","unstructured":"Afek, Y., Awerbuch, B., Plotkin, S.A., Saks, M.E.: Local management of a global resource in a communication network. J. ACM\u00a043(1), 1\u201319 (1996)","journal-title":"J. ACM"},{"issue":"2","key":"53_CR3","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1145\/1103963.1103966","volume":"1","author":"S. Alstrup","year":"2005","unstructured":"Alstrup, S., Holm, J., de Lichtenberg, K., Thorup, M.: Maintaining information in fully dynamic trees with top trees. ACM Transactions on Algorithms\u00a01(2), 243\u2013264 (2005), announced at ICALP 1997 and SWAT 2000","journal-title":"ACM Transactions on Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Cidon, I., Kutten, S.: Optimal maintenance of a spanning tree. J. ACM\u00a055(4) (2008); announced at FOCS 1990","key":"53_CR4","DOI":"10.1145\/1391289.1391292"},{"doi-asserted-by":"crossref","unstructured":"Bernstein, A., Roditty, L.: Improved dynamic algorithms for maintaining approximate shortest paths under deletions. In: SODA, pp. 1355\u20131365 (2011)","key":"53_CR5","DOI":"10.1137\/1.9781611973082.104"},{"issue":"7-9","key":"53_CR6","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1016\/j.tcs.2009.11.008","volume":"411","author":"S. Cicerone","year":"2010","unstructured":"Cicerone, S., D\u2019Angelo, G., Stefano, G.D., Frigioni, D.: Partially dynamic efficient algorithms for distributed shortest paths. Theor. Comput. Sci.\u00a0411(7-9), 1013\u20131037 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"9","key":"53_CR7","doi-asserted-by":"publisher","first-page":"16","DOI":"10.4304\/jcp.2.9.16-26","volume":"2","author":"S. Cicerone","year":"2007","unstructured":"Cicerone, S., D\u2019Angelo, G., Stefano, G.D., Frigioni, D., Petricola, A.: Partially dynamic algorithms for distributed shortest paths and their experimental evaluation. JCP\u00a02(9), 16\u201326 (2007)","journal-title":"JCP"},{"doi-asserted-by":"crossref","unstructured":"Elkin, M.: A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners. In: PODC, pp. 185\u2013194 (2007)","key":"53_CR8","DOI":"10.1145\/1281100.1281128"},{"issue":"1","key":"53_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/322234.322235","volume":"28","author":"S. Even","year":"1981","unstructured":"Even, S., Shiloach, Y.: An on-line edge-deletion problem. J. ACM\u00a028(1), 1\u20134 (1981)","journal-title":"J. ACM"},{"issue":"2","key":"53_CR10","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1093\/ietisy\/e89-d.2.700","volume":"89-D","author":"P. Flocchini","year":"2006","unstructured":"Flocchini, P., Enriques, A.M., Pagli, L., Prencipe, G., Santoro, N.: Point-of-failure shortest-path rerouting: Computing the optimal swap edges distributively. IEICE Transactions\u00a089-D(2), 700\u2013708 (2006)","journal-title":"IEICE Transactions"},{"key":"53_CR11","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1137\/S0097539794261118","volume":"27","author":"J. Garay","year":"1998","unstructured":"Garay, J., Kutten, S., Peleg, D.: A sublinear time distributed algorithm for minimum-weight spanning trees. SIAM J. on Computing\u00a027, 302\u2013316 (1998); announced at FOCS 1993","journal-title":"SIAM J. on Computing"},{"issue":"1","key":"53_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TDSC.2009.17","volume":"8","author":"B. Gfeller","year":"2011","unstructured":"Gfeller, B., Santoro, N., Widmayer, P.: A distributed algorithm for finding all best swap edges of a minimum-diameter spanning tree. IEEE Trans. Dependable Sec. Comput.\u00a08(1), 1\u201312 (2011), announced at DISC 2007","journal-title":"IEEE Trans. Dependable Sec. Comput."},{"issue":"4","key":"53_CR13","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s00446-012-0160-1","volume":"25","author":"T.P. Hayes","year":"2012","unstructured":"Hayes, T.P., Saia, J., Trehan, A.: The forgiving graph: a distributed data structure for low stretch under adversarial attack. Distributed Computing\u00a025(4), 261\u2013278 (2012); announced at PODC 2009","journal-title":"Distributed Computing"},{"doi-asserted-by":"crossref","unstructured":"Italiano, G.F.: Distributed algorithms for updating shortest paths. In: WDAG(DISC), pp. 200\u2013211 (1991)","key":"53_CR14","DOI":"10.1007\/BFb0022448"},{"issue":"3","key":"53_CR15","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/PL00009225","volume":"22","author":"G.F. Italiano","year":"1998","unstructured":"Italiano, G.F., Ramaswami, R.: Maintaining spanning trees of small diameter. Algorithmica\u00a022(3), 275\u2013304 (1998)","journal-title":"Algorithmica"},{"issue":"3","key":"53_CR16","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s00446-012-0157-9","volume":"25","author":"M. Khan","year":"2012","unstructured":"Khan, M., Kuhn, F., Malkhi, D., Pandurangan, G., Talwar, K.: Efficient distributed approximation algorithms via probabilistic tree embeddings. Distributed Computing\u00a025(3), 189\u2013205 (2012); announced at PODC 2008","journal-title":"Distributed Computing"},{"doi-asserted-by":"crossref","unstructured":"King, V.: Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. In: FOCS, pp. 81\u201391 (1999)","key":"53_CR17","DOI":"10.1145\/301250.301380"},{"doi-asserted-by":"crossref","unstructured":"Korman, A.: Improved compact routing schemes for dynamic trees. In: PODC, pp. 185\u2013194 (2008)","key":"53_CR18","DOI":"10.1145\/1400751.1400777"},{"key":"53_CR19","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.ic.2012.10.018","volume":"223","author":"A. Korman","year":"2013","unstructured":"Korman, A., Kutten, S.: Controller and estimator for dynamic networks. Inf. Comput.\u00a0223, 43\u201366 (2013)","journal-title":"Inf. Comput."},{"doi-asserted-by":"crossref","unstructured":"Korman, A., Peleg, D.: Dynamic routing schemes for graphs with low local density. ACM Transactions on Algorithms 4(4) (2008)","key":"53_CR20","DOI":"10.1145\/1383369.1383372"},{"issue":"5","key":"53_CR21","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s00224-004-1080-z","volume":"37","author":"D. Krizanc","year":"2004","unstructured":"Krizanc, D., Luccio, F.L., Raman, R.: Compact routing schemes for dynamic ring networks. Theory Comput. Syst.\u00a037(5), 585\u2013607 (2004)","journal-title":"Theory Comput. Syst."},{"doi-asserted-by":"crossref","unstructured":"Kuhn, F., Lynch, N.A., Oshman, R.: Distributed computation in dynamic networks. In: STOC, pp. 513\u2013522 (2010)","key":"53_CR22","DOI":"10.1145\/1806689.1806760"},{"key":"53_CR23","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers, San Francisco (1996)"},{"doi-asserted-by":"crossref","unstructured":"Malpani, N., Welch, J.L., Vaidya, N.H.: Leader election algorithms for mobile ad hoc networks. In: DIAL-M, pp. 96\u2013103 (2000)","key":"53_CR24","DOI":"10.1145\/345848.345871"},{"key":"53_CR25","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed computing: a locality-sensitive approach","author":"D. Peleg","year":"2000","unstructured":"Peleg, D.: Distributed computing: a locality-sensitive approach. SIAM, Philadelphia (2000)"},{"issue":"2","key":"53_CR26","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0196-6774(92)90017-7","volume":"13","author":"K.V.S. Ramarao","year":"1992","unstructured":"Ramarao, K.V.S., Venkatesan, S.: On finding and updating shortest paths distributively. J. Algorithms\u00a013(2), 235\u2013257 (1992)","journal-title":"J. Algorithms"},{"issue":"2","key":"53_CR27","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s00453-010-9401-5","volume":"61","author":"L. Roditty","year":"2011","unstructured":"Roditty, L., Zwick, U.: On dynamic shortest paths problems. Algorithmica\u00a061(2), 389\u2013401 (2011); announced at ESA 2004","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39212-2_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,2]],"date-time":"2023-07-02T20:46:39Z","timestamp":1688330799000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39212-2_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392115","9783642392122"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39212-2_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}