Back to Results
First PageMeta Content
Graph coloring / NP-complete problems / Analysis of algorithms / SL / Randomized algorithm / Path decomposition / Tree decomposition / Theoretical computer science / Graph theory / Mathematics


Complexity analysis of a decentralised graph colouring algorithm K. R. Duffy(1) , N. O’Connell(2) and A. Sapozhnikov(3)
Add to Reading List

Document Date: 2009-06-19 10:59:28


Open Document

File Size: 147,36 KB

Share Result on Facebook

City

Berlin / San Francisco / Maynooth / Amsterdam / Coventry / /

Company

W. H. Freeman and Co. / /

Country

Netherlands / United Kingdom / Ireland / /

Facility

University of Warwick / National University of Ireland / University College Cork / Hamilton Institute / Mathematics Institute / /

IndustryTerm

wireless computer networks / distributed graph colouring algorithms / polynomial time algorithms / wireless channel allocation / decentralised graph colouring algorithm / wireless network / stochastic colouring algorithm / distributed learning algorithms / decentralised colouring algorithm / graph coloring algorithms / graph algorithms / wireless networks / distributed graph algorithms / /

Organization

Hamilton Institute / National University of Ireland / University of Warwick / Science Foundation Ireland / Mathematics Institute / /

Person

Noga Alon / Feder Motwani / David S. Johnson / Rajeev Motwani / Michael R. Garey / Nabil Kahale / Jonathan S. Turner / /

Position

author / controller / /

ProvinceOrState

California / /

Technology

graph algorithms / randomized algorithm / distributed graph algorithms / distributed learning algorithms / stochastic colouring algorithm / WLAN / graph coloring algorithms / J. Algorithms / time algorithms / CFL algorithm / decentralised colouring algorithm / polynomial time algorithms / decentralised graph colouring algorithm / distributed graph colouring algorithms / 2 The algorithm The CFL algorithm / decentralised algorithm / /

SocialTag