{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T10:38:14Z","timestamp":1725619094415},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642245497"},{"type":"electronic","value":"9783642245503"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24550-3_33","type":"book-chapter","created":{"date-parts":[[2011,10,8]],"date-time":"2011-10-08T02:56:37Z","timestamp":1318042597000},"page":"433-434","source":"Crossref","is-referenced-by-count":4,"title":["Brief Announcement: A Stabilizing Algorithm for Finding Two Edge-Disjoint Paths in Arbitrary Graphs"],"prefix":"10.1007","author":[{"given":"Fawaz M.","family":"Al-Azemi","sequence":"first","affiliation":[]},{"given":"Mehmet Hakan","family":"Karaata","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"11","key":"33_CR1","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E.W. Dijkstra","year":"1974","unstructured":"Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Communications of the ACM\u00a017(11), 643\u2013644 (1974)","journal-title":"Communications of the ACM"},{"issue":"5","key":"33_CR2","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1016\/j.comcom.2008.12.035","volume":"32","author":"R. Hadid","year":"2009","unstructured":"Hadid, R., Karaata, M.H.: An adaptive stabilizing algorithm for finding all disjoint paths in anonymous mesh networks. Computer Communications\u00a032(5), 858\u2013866 (2009)","journal-title":"Computer Communications"},{"unstructured":"Ishida, K., Kakuda, Y., Kikuno, T., Amano, K.: A distributed routing protocol for finding two node-disjoint paths in computer networks","key":"33_CR3"},{"issue":"2","key":"33_CR4","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1109\/18.212275","volume":"39","author":"R.G. Ogier","year":"1993","unstructured":"Ogier, R.G., Rutenburg, V., Shacham, N.: Distributed algorithms for computing shortest pairs of disjoint paths. IEEE Transactions on Information Theory\u00a039(2), 443\u2013455 (1993)","journal-title":"IEEE Transactions on Information Theory"},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/net.3230040204","volume":"4","author":"J.W. Suurballe","year":"1974","unstructured":"Suurballe, J.W.: Disjoint paths in a network. Networks\u00a04, 125\u2013145 (1974)","journal-title":"Networks"},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1002\/net.3230140209","volume":"14","author":"J.W. Suurballe","year":"1984","unstructured":"Suurballe, J.W., Tarjan, R.E.: A quick method for finding shortest pairs of disjoint paths. Networks\u00a014, 325\u2013379 (1984)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24550-3_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T06:40:52Z","timestamp":1554878452000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24550-3_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642245497","9783642245503"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24550-3_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}