FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

DOI10.1007/B104325MaRDI QIDQ5465876zbMATH OpenOpenAlexFDO

Authors Srinivasan Parthasarathy, Rajiv Gandhi

Publication date 12 August 2005

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

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

Mathematics Subject Classification ID

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

Recommendations

• Distributed algorithms for connected domination in wireless networks
• Coloring unstructured radio networks
• Coloring unstructured wireless multi-hop networks
• Distributed routing algorithms for multi-hop ad hoc networks using \(d\)-hop connected \(d\)-dominating sets
• Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time

Cited in

(12)

• Locating battery charging stations to facilitate almost shortest paths
• Distributed routing algorithms for multi-hop ad hoc networks using \(d\)-hop connected \(d\)-dominating sets
• Distributed long-lived list colouring: How to dynamically allocate frequencies in cellular networks
• Distributed algorithms for connected domination in wireless networks
• Coloring unstructured radio networks
• Distributed colorings for collision-free routing in sink-centric sensor networks
• Coloring unstructured wireless multi-hop networks
• Experimental evaluation of distributed node coloring algorithms for wireless networks
• Locating battery charging stations to facilitate almost shortest paths
• Algorithms – ESA 2004
• Distributed approximation of capacitated dominating sets
• Energy-efficient distributed clustering in wireless sensor networks

This page was built for publication: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

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