121 search results - page 25 / 25 » Upper Bounds on Number of Steals in Rooted Trees |
WINET
2010
13 years 3 months ago
2010
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...