![Graph / Connectivity / Topology / Graph coloring / Petersen graph / Planar separator theorem / Graph theory / NP-complete problems / Unit disk graph Graph / Connectivity / Topology / Graph coloring / Petersen graph / Planar separator theorem / Graph theory / NP-complete problems / Unit disk graph](https://www.pdfsearch.io/img/31bf77371bfc584d23a086703bc815e9.jpg)
| Document Date: 2004-08-11 12:11:55 Open Document File Size: 178,55 KBShare Result on Facebook
City Philadelphia / Robust Position / / Company Dell / 3SAT / Wireless Ad Hoc Networks / ACM Press / / Country United States / / Currency USD / / / IndustryTerm wireless multi-hop networks / energy consumption / higher-layer protocols / sensor networks / Internet graph / ad hoc networks / approximation algorithm / anycast and peer-to-peer systems / Internet Network Distance / idealized multi-hop radio network / wireless networking / geometric routing algorithm / multi-hop radio networks / graph algorithms / Internet mapping / Wireless Networks / approximation algorithms / sensor network / / Organization National Competence Center / Swiss National Science Foundation / / Person Thomas Moscibroda Roger Wattenhofer / Fabian Kuhn Thomas Moscibroda Roger / / Position General / / ProgrammingLanguage Hoc / / ProvinceOrState Pennsylvania / / Technology graph algorithms / geometric routing algorithm / peer-to-peer / approximation algorithm / existing approximation algorithm / Mobile Computing / approximation algorithms / higher-layer protocols / /
SocialTag |