Checco, A. orcid.org/0000-0002-0981-3409 and Leith, D.J. (2017) Fast, responsive decentralized graph coloring. IEEE/ACM Transactions on Networking, 25 (6). pp. 3628-3640. ISSN 1063-6692
Abstract
Graph coloring problem arises in numerous networking applications. We solve it in a fully decentralized way (ı.e., with no message passing). We propose a novel algorithm that is automatically responsive to topology changes, and we prove that it converges to a proper coloring in O(NlogN) time with high probability for generic graphs, when the number of available colors is greater than Δ , the maximum degree of the graph, and in O(logN) time if Δ=O(1) . We believe the proof techniques used in this paper are of independent interest and provide new insight into the properties required to ensure fast convergence of decentralized algorithms.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works. Reproduced in accordance with the publisher's self-archiving policy. |
Keywords: | Graph theory; network theory (graphs); wireless networks |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Social Sciences (Sheffield) > Information School (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 18 Jan 2018 13:27 |
Last Modified: | 19 Jan 2018 11:51 |
Published Version: | https://doi.org/10.1109/TNET.2017.2751544 |
Status: | Published |
Publisher: | Institute of Electrical and Electronics Engineers |
Refereed: | Yes |
Identification Number: | 10.1109/TNET.2017.2751544 |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:126299 |