{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:06:05Z","timestamp":1743033965243,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319690834"},{"type":"electronic","value":"9783319690841"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-69084-1_22","type":"book-chapter","created":{"date-parts":[[2017,10,6]],"date-time":"2017-10-06T03:30:06Z","timestamp":1507260606000},"page":"308-322","source":"Crossref","is-referenced-by-count":1,"title":["A Fully Asynchronous and Fault Tolerant Distributed Algorithm to Compute a Minimum Graph Orientation"],"prefix":"10.1007","author":[{"given":"No\u00ebl","family":"Gillet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Hanusse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,7]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Kutten, S., Mansour, Y., Patt-Shamir, B., Varghese, G.: Time optimal self-stabilizing synchronization. In: Rao Kosaraju, S., Johnson, D.S., Aggarwal, A. (eds.) Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 16\u201318 May 1993, San Diego, CA, USA, pp. 652\u2013661. ACM (1993)","DOI":"10.1145\/167088.167256"},{"key":"22_CR2","unstructured":"Asahiro, Y., Miyano, E., Ono, H., Zenmyo, K.: Graph orientation algorithms to minimize the maximum outdegree. In: Proceedings of the 12th Computing: The Australasian Theory Symposium, vol. 51, pp. 11\u201320. Australian Computer Society Inc. (2006)"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Patt-Shamir, B., Peleg, D., Saks, M.E.: Adapting to asynchronous dynamic networks (extended abstract). In: Rao Kosaraju, S., Fellows, M., Wigderson, A., Ellis, J.A. (eds.) Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 4\u20136 May 1992, Victoria, British Columbia, Canada, pp. 557\u2013570. ACM (1992)","DOI":"10.1145\/129712.129767"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Sipser, M.: Dynamic networks are as fast as static networks (preliminary version). In 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24\u201326 , pp. 206\u2013220. IEEE Computer Society, October 1988","DOI":"10.1109\/SFCS.1988.21938"},{"issue":"4","key":"22_CR5","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1145\/4221.4227","volume":"32","author":"B Awerbuch","year":"1985","unstructured":"Awerbuch, B.: Complexity of network synchronization. J. ACM 32(4), 804\u2013823 (1985)","journal-title":"J. ACM"},{"issue":"5\u20136","key":"22_CR6","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s00446-009-0088-2","volume":"22","author":"L Barenboim","year":"2010","unstructured":"Barenboim, L., Elkin, M.: Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition. Distrib. Comput. 22(5\u20136), 363\u2013379 (2010)","journal-title":"Distrib. Comput."},{"key":"22_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-02009-4","volume-title":"Distributed Graph Coloring: Fundamentals and Recent Developments Synthesis Lectures on Distributed Computing Theory","author":"L Barenboim","year":"2013","unstructured":"Barenboim, L., Elkin, M.: Distributed Graph Coloring: Fundamentals and Recent Developments Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers, San Rafael (2013)"},{"key":"22_CR8","unstructured":"Apache Cassandra. http:\/\/apache.cassandra.org"},{"issue":"2","key":"22_CR9","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-54423-1_22","volume-title":"LATIN 2014: Theoretical Informatics","author":"Mart\u00edn Farach-Colton","year":"2014","unstructured":"Farach-Colton, M., Tsai, M.-T.: Computing the degeneracy of large graphs. In: Pardo, A., Viola, A. (eds.) LATIN 2014. LNCS, vol. 8392, pp. 250\u2013260. Springer, Heidelberg (2014). doi: 10.1007\/978-3-642-54423-1_22"},{"key":"22_CR11","unstructured":"Gy\u00e1rf\u00e1s, A., Frank, A.: How to orient the edges of a graph. Combinatorics 18, 353\u2013362 (1978)"},{"issue":"5&6","key":"22_CR12","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/BF01758774","volume":"7","author":"HN Gabow","year":"1992","unstructured":"Gabow, H.N., Westermann, H.H.: Forests, frames, and games: algorithms for matroid sums and applications. Algorithmica 7(5&6), 465\u2013497 (1992)","journal-title":"Algorithmica"},{"key":"22_CR13","unstructured":"Apache HBase. http:\/\/apache.cassandra.org"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/11940128_56","volume-title":"Algorithms and Computation","author":"\u0141 Kowalik","year":"2006","unstructured":"Kowalik, \u0141.: Approximation scheme for lowest outdegree orientation and graph density measures. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 557\u2013566. Springer, Heidelberg (2006). doi: 10.1007\/11940128_56"},{"key":"22_CR15","unstructured":"Mitzenmacher, M.D.: The power of two choices in randomized load balancing. Ph.D. thesis, University of California at Berkeley (1996)"},{"key":"22_CR16","volume-title":"Art Gallery Theorems and Algorithms","author":"J O\u2019Rourke","year":"1987","unstructured":"O\u2019Rourke, J.: Art Gallery Theorems and Algorithms. Oxford University Press, Oxford (1987)"},{"key":"22_CR17","doi-asserted-by":"publisher","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. Society for Industrial and Applied Mathematics (2000). doi: 10.1137\/1.9780898719772","DOI":"10.1137\/1.9780898719772"},{"issue":"2","key":"22_CR18","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1109\/SURV.2012.062612.00084","volume":"15","author":"NA Pantazis","year":"2013","unstructured":"Pantazis, N.A., Nikolidakis, S.A., Vergados, D.D.: Energy-efficient routing protocols in wireless sensor networks: a survey. IEEE Commun. Surv. Tutorials 15(2), 551\u2013591 (2013)","journal-title":"IEEE Commun. Surv. Tutorials"},{"issue":"1","key":"22_CR19","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1142\/S0129054194000037","volume":"5","author":"G Tel","year":"1994","unstructured":"Tel, G.: Network orientation. Int. J. Found. Comput. Sci. 5(1), 23\u201357 (1994)","journal-title":"Int. J. Found. Comput. Sci."}],"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-319-69084-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T01:28:18Z","timestamp":1659576498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-69084-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319690834","9783319690841"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-69084-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}