First Page | Document Content | |
---|---|---|
Date: 2005-05-19 08:04:24NP-complete problems Graph coloring Search algorithms Connectivity Unit disk graph Nearest neighbor search Distributed computing Connected component Dominating set Theoretical computer science Graph theory Mathematics | On the Locality of Bounded Growth Fabian Kuhn Thomas Moscibroda Roger WattenhoferAdd to Reading ListSource URL: distcomp.ethz.chDownload Document from Source WebsiteFile Size: 157,57 KBShare Document on Facebook |