| Document Date: 2006-06-02 03:09:51
Open Document File Size: 164,00 KBShare Result on Facebook
City Denver / Zurich / / Company Wireless Sensor Networks / SIAM Journal / Israel Journal / Microsoft / / Country Sudan / United States / / Currency USD / / / IndustryTerm set cover greedy algorithm / given distributed algorithm / distributed algorithm / communicationefficient algorithms / dynamic and mobile distributed systems / distributed computing / classical applications / integer solution / slot assignment algorithm / graph algorithms / wireless networks / deterministic distributed algorithm / given network / deterministic algorithms / t-coloring algorithm / sensor networks / randomized algorithm / constant-time algorithms / given algorithm / greedy algorithm / distributed coloring algorithms / randomized coloring algorithms / round algorithm / given fractional set cover solution / sequential algorithm / deterministic algorithm / fractional solution / computing / parallel algorithm / iterative applications / sequential systems / randomized parallel algorithm / distributed graph algorithms / deterministic coloring algorithms / / Person Fabian Kuhn Roger Wattenhofer / / Position standard message passing model for distributed computing / General / / ProvinceOrState South Carolina / Colorado / / PublishedMedium SIAM Journal on Computing / Theory of Computing / Lecture Notes in Computer Science / / Technology distributed TDMA slot assignment algorithm / distributed coloring algorithms / one-round algorithms / randomized algorithm / one-round coloring algorithms / randomized parallel algorithm / distributed MIS algorithm / given distributed algorithm / Two processors / time algorithm / deterministic one-round algorithm / corresponding processors / randomized one-round algorithm / deterministic one-round t-coloring algorithm / deterministic distributed algorithm / randomized one-round coloring algorithms / presented algorithm / round algorithm / graph algorithms / sequential algorithm / set cover greedy algorithm / distributed algorithm / distributed graph algorithms / randomized coloring algorithms / given algorithm / deterministic algorithm / described algorithms / constant-time algorithms / MIS algorithms / deterministic one-round algorithms / deterministic coloring algorithms / one-round coloring algorithm / one-round algorithm / local algorithm / communicationefficient algorithms / /
SocialTag |
On the Complexity of Distributed Graph Coloring Fabian Kuhn Roger Wattenhofer Microsoft Research – Silicon Valley