Wireless networking: Graph theory unplugged

DOI10.1007/978-3-540-30559-0_2MaRDI QIDQ5710804zbMATH OpenOpenAlexFDO

Authors Roger Wattenhofer

Publication date 8 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b104584

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Graph theoretic clustering algorithms in mobile ad hoc networks and wireless sensor networks
• Local solutions for global problems in wireless networks
• SOFSEM 2006: Theory and Practice of Computer Science
• Theoretical Aspects of Graph Models for MANETs
• Graph domination, coloring and cliques in telecommunications

Cited in

(8)

• A breadth-first search with betweenness
• Graph theory and opportunistic link scheduling in wireless ad hoc networks
• scientific article; zbMATH DE number 1756641 (Why is no real title available?)
• Hypergraph theory in wireless communication networks
• Some \(k\)-hop based graph metrics and node ranking in wireless sensor networks
• Graph domination, coloring and cliques in telecommunications
• Graph theoretic clustering algorithms in mobile ad hoc networks and wireless sensor networks
• Convexities, Centroids in Graphs and their Application in Mobile Ad hoc Networks

This page was built for publication: Wireless networking: Graph theory unplugged

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710804)