{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T15:30:54Z","timestamp":1729611054223,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1109\/ispan.2004.1300451","type":"proceedings-article","created":{"date-parts":[[2004,6,10]],"date-time":"2004-06-10T14:19:45Z","timestamp":1086877185000},"page":"18-23","source":"Crossref","is-referenced-by-count":7,"title":["Dynamic update of shortest path tree in OSPF"],"prefix":"10.1109","author":[{"family":"Bin Xiao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Jiannong Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Qingfeng Zhuge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Zili Shao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.H.M.","family":"Sha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"212","article-title":"Fully dynamic output bounded single source shortest path problem","author":"frigioni","year":"1998","journal-title":"Proc 7th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/90.893870"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/90.974525"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","article-title":"On a routing problem","volume":"16","author":"bellman","year":"1958","journal-title":"Quarterly Applied Mathematics"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.1003042"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/65.898822"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383077"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/nem.492"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/nem.485"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.810317"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2002.997364"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"2258","DOI":"10.1109\/ICC.2002.997248","article-title":"A destination-driven shortest path tree algorithm","volume":"4","author":"zhang","year":"2002","journal-title":"Proc IEEE International Conference on Communications"}],"event":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","start":{"date-parts":[[2004,5,12]]},"location":"Hong Kong, China","end":{"date-parts":[[2004,5,12]]}},"container-title":["7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9103\/28881\/01300451.pdf?arnumber=1300451","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,30]],"date-time":"2018-05-30T15:07:51Z","timestamp":1527692871000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1300451\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/ispan.2004.1300451","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}