{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:44:04Z","timestamp":1725486244300},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433668"},{"type":"electronic","value":"9783540459316"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45931-6_12","type":"book-chapter","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T04:53:52Z","timestamp":1181364832000},"page":"159-171","source":"Crossref","is-referenced-by-count":8,"title":["A Characterization of Families of Graphs in Which Election Is Possible"],"prefix":"10.1007","author":[{"given":"Emmanuel","family":"Godard","sequence":"first","affiliation":[]},{"given":"Yves","family":"M\u00e9tivier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"D. Angluin. Local and global properties in networks of processors. In Proceedings of the 12th Symposium on theory of computing, pages 82\u201393, 1980.","DOI":"10.1145\/800141.804655"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"P. Boldi and S. Vigna. Computing anonymously with arbitrary knowledge. In Proceedings of the 18th ACM Symposium on principles of distributed computing, pages 181\u2013188. ACM Press, 1999.","DOI":"10.1145\/301308.301355"},{"key":"12_CR3","first-page":"219","volume-title":"Graph theory and computing","author":"J.-R. Fiksel","year":"1972","unstructured":"J.-R. Fiksel, A. Holliger, and P. Rosenstiehl. Intelligent graphs. In R. Read, editor, Graph theory and computing, pages 219\u2013265. Academic Press (New York), 1972."},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"E. Godard. A self-stabilizing enumeration algorithm. Inform. Proc. Letters, to appear.","DOI":"10.1016\/S0020-0190(01)00291-5"},{"issue":"1","key":"12_CR5","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/71.481599","volume":"7","author":"T. Kameda","year":"1996","unstructured":"T. Kameda and M. Yamashita. Computing on anonymous networks: Part i-characterizing the solvable cases. IEEE Transactions on parallel and distributed systems, 7(1):69\u201389, 1996.","journal-title":"IEEE Transactions on parallel and distributed systems"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"W. S. Massey. A basic course in algebraic topology. Springer-Verlag, 1991 Graduate texts in mathematics.","DOI":"10.1007\/978-1-4939-9063-4"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0020-0190(97)00022-7","volume":"61","author":"A. Mazurkiewicz","year":"1997","unstructured":"A. Mazurkiewicz. Distributed enumeration. Inf. Processing Letters, 61:233\u2013239, 1997.","journal-title":"Inf. Processing Letters"},{"key":"12_CR8","unstructured":"Y. M\u00e9tivier, A. Muscholl, and P.-A. Wacrenier. About the local detection of termination of local computations in graphs. In International Colloquium on structural information and communication complexity, pages 188\u2013200, 1997."},{"key":"12_CR9","unstructured":"Y. M\u00e9tivier and G. Tel. Termination detection and universal graph reconstruction. In International Colloquium on structural information and communication complexity, pages 237\u2013251, 2000."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"B. Szymanski, Y. Shy, and N. Prywes. Terminating iterative solutions of simultaneous equations in distributed message passing systems. In Proceedings of the 4th Symposium on Principles of Distributed computing, pages 287\u2013292, 1985.","DOI":"10.1145\/323596.323623"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"G. Tel. Introduction to distributed algorithms. Cambridge University Press, 2000.","DOI":"10.1017\/CBO9781139168724"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45931-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,22]],"date-time":"2020-04-22T23:59:00Z","timestamp":1587599940000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45931-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433668","9783540459316"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45931-6_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}