The energy complexity of diameter and minimum cut computation in bounded-genus networks
From MaRDI portal
Publication:6199403
DOI10.1016/j.tcs.2023.114279OpenAlexW4388158322MaRDI QIDQ6199403
Publication date: 23 February 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2023.114279
Cites Work
- Unnamed Item
- Unnamed Item
- Distributed minimum dominating set approximations in restricted families of graphs
- Quasi-optimal energy-efficient leader election algorithms in radio networks
- Energy efficient randomised communication in unknown AdHoc networks
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Power consumption in packet radio networks
- A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs
- Local Computation
- Energy and Time Efficient Broadcasting in Known Topology Radio Networks
- Fast Distributed Approximations in Planar Graphs
- On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
- Weak communication in single‐hop radio networks: adjusting algorithms to industrial standards
- Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut
- Exponential separations in the energy complexity of leader election
- Efficient algorithms for leader election in radio networks
- The Energy Complexity of Broadcast
- Minor Excluded Network Families Admit Fast Distributed Algorithms
- Planar diameter via metric compression
- Contention resolution with log-logstar channel accesses
- A Local Constant Factor MDS Approximation for Bounded Genus Graphs
- Fast approximation algorithms for the diameter and radius of sparse graphs
- Automata, Languages and Programming
- Sleeping is Efficient: MIS in O (1)-rounds Node-averaged Awake Complexity
- The Energy Complexity of BFS in Radio Networks
- Algorithms - ESA 2003
- Algorithms and Computation
- Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election
- Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks
This page was built for publication: The energy complexity of diameter and minimum cut computation in bounded-genus networks
