{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:46:59Z","timestamp":1725544019425},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540345978"},{"type":"electronic","value":"9783540345985"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11764298_27","type":"book-chapter","created":{"date-parts":[[2006,5,19]],"date-time":"2006-05-19T08:37:56Z","timestamp":1148027876000},"page":"291-302","source":"Crossref","is-referenced-by-count":2,"title":["Updating Directed Minimum Cost Spanning Trees"],"prefix":"10.1007","author":[{"given":"Gerasimos G.","family":"Pollatos","sequence":"first","affiliation":[]},{"given":"Orestis A.","family":"Telelis","sequence":"additional","affiliation":[]},{"given":"Vassilis","family":"Zissimopoulos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69B","author":"J. Edmonds","year":"1967","unstructured":"Edmonds, J.: Optimum branchings. Journal of Research of the National Bureau for Standards\u00a069B, 125\u2013130 (1967)","journal-title":"Journal of Research of the National Bureau for Standards"},{"key":"27_CR2","unstructured":"Kang, I., Poovendran, R.: Maximizing network lifetime of broadcasting over wireless stationary adhoc networks. Mobile Networks\u00a011 (to appear, 2006)"},{"key":"27_CR3","unstructured":"Li, N., Hou, J.: Topology Control in Heterogeneous Wireless Networks: Problems and Solutions. In: Proceedings of the 23rd IEEE INFOCOM (2004)"},{"key":"27_CR4","unstructured":"Li, Z., Hauck, S.: Configuration compression for virtex fpgas. In: Proceedings of the 9th IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM 2001, pp. 147\u2013159 (2001)"},{"key":"27_CR5","unstructured":"He, L., Mitra, T., Wong, W.: Configuration bitstream compression for dynamically reconfigurable FPGAs. In: Proceedings of the 2004 International Conference on Computer-Aided Design, ICCAD 2004, pp. 766\u2013773 (2004)"},{"key":"27_CR6","unstructured":"Bock, F.: An algorithm to construct a minimum spanning tree in a directed network. In: Developments in Operations Research. Gordon and Breach, pp. 29\u201344 (1971)"},{"key":"27_CR7","first-page":"1396","volume":"14","author":"Y.J. Chu","year":"1965","unstructured":"Chu, Y.J., Liu, T.H.: On the shortest arborescence of a directed graph. Scientia Sinica\u00a014, 1396\u20131400 (1965)","journal-title":"Scientia Sinica"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1002\/net.3230070103","volume":"7","author":"R.E. Tarjan","year":"1977","unstructured":"Tarjan, R.E.: Finding optimum branchings. Networks\u00a07, 25\u201335 (1977)","journal-title":"Networks"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF02579168","volume":"6","author":"H.N. Gabow","year":"1986","unstructured":"Gabow, H.N., Galil, Z., Spencer, T.H., Tarjan, R.E.: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica\u00a06, 109\u2013122 (1986)","journal-title":"Combinatorica"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-27810-8_20","volume-title":"Algorithm Theory - SWAT 2004","author":"R. Mendelson","year":"2004","unstructured":"Mendelson, R., Tarjan, R.E., Thorup, M., Zwick, U.: Melding Priority Queues. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 223\u2013235. Springer, Heidelberg (2004)"},{"key":"27_CR11","volume-title":"Algorithms and Theory of Computation Handbook","author":"D. Eppstein","year":"1999","unstructured":"Eppstein, D., Galil, Z., Italiano, G.F.: 8: Dynamic graph algorithms. In: Algorithms and Theory of Computation Handbook, CRC Press, Boca Raton (1999)"},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1145\/502090.502095","volume":"48","author":"J. Holm","year":"2001","unstructured":"Holm, J., de Lichtenberg, K., Thorup, M.: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. Journal of the ACM\u00a048, 723\u2013760 (2001)","journal-title":"Journal of the ACM"},{"key":"27_CR13","unstructured":"Alpern, B., Hoover, R., Rosen, B.K., Sweeney, P.F., Zadeck, F.K.: Incremental evaluation of computational circuits. In: Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms, SODA 1990, pp. 32\u201342 (1990)"},{"issue":"1&2","key":"27_CR14","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0304-3975(95)00079-8","volume":"158","author":"G. Ramalingam","year":"1996","unstructured":"Ramalingam, G., Reps, T.: On the complexity of dynamic graph problems. Theoretical Computer Science\u00a0158(1&2), 233\u2013277 (1996)","journal-title":"Theoretical Computer Science"},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1006\/jagm.1999.1048","volume":"34","author":"D. Frigioni","year":"2000","unstructured":"Frigioni, D., Marchetti-Spaccamela, A., Nanni, U.: Fully dynamic algorithms for maintaining shortest paths trees. Journal of Algorithms\u00a034, 251\u2013281 (2000)","journal-title":"Journal of Algorithms"},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-540-24838-5_29","volume-title":"Experimental and Efficient Algorithms","author":"D.J. Pearce","year":"2004","unstructured":"Pearce, D.J., Kelly, P.H.J.: A Dynamic Algorithm for Topologically Sorting Directed Acyclic Graphs. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol.\u00a03059, pp. 383\u2013398. Springer, Heidelberg (2004)"},{"issue":"3","key":"27_CR17","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0204032","volume":"4","author":"P.M. Spira","year":"1975","unstructured":"Spira, P.M., Pan, A.: On Finding and Updating Spanning Trees and Shortest Paths. SIAM Journal on Computing\u00a04(3), 364\u2013380 (1975)","journal-title":"SIAM Journal on Computing"},{"key":"27_CR18","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1016\/S0022-0000(72)80034-5","volume":"6","author":"M.O. Rabin","year":"1972","unstructured":"Rabin, M.O.: Proving simultaneous positivity of linear forms. Journal of Computers and Systems Sciences\u00a06, 639\u2013650 (1972)","journal-title":"Journal of Computers and Systems Sciences"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11764298_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:10:56Z","timestamp":1619507456000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11764298_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540345978","9783540345985"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11764298_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}