Lower and upper bounds for deterministic convergecast with labeling schemes
From MaRDI portal
Publication:2693630
DOI10.1016/j.tcs.2023.113775OpenAlexW3048935827MaRDI QIDQ2693630
Zvi Lotker, Gewu Bu, Mikaël Rabie, Maria Gradinariu Potop-Butucaru
Publication date: 24 March 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2023.113775
Related Items (1)
Cites Work
- Unnamed Item
- Local MST computation with short advice
- Tree exploration with advice
- Distributed time-optimal scheduling for convergecast in wireless sensor networks
- Distance labeling in graphs
- Time vs. Information Tradeoffs for Leader Election in Anonymous Trees
- Label-guided graph exploration by a finite automaton
- Short labeling schemes for topology recognition in wireless tree networks
This page was built for publication: Lower and upper bounds for deterministic convergecast with labeling schemes