The energy complexity of diameter and minimum cut computation in bounded-genus networks
From MaRDI portal
Publication:6199403
DOI10.1016/J.TCS.2023.114279OpenAlexW4388158322MaRDI QIDQ6199403FDOQ6199403
Authors: Yi-Jun Chang 
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
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Fast approximation algorithms for the diameter and radius of sparse graphs
- Automata, Languages and Programming
- On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
- Energy efficient randomised communication in unknown AdHoc networks
- Energy and Time Efficient Broadcasting in Known Topology Radio Networks
- Local computation: lower and upper bounds
- Fast Distributed Approximations in Planar Graphs
- Distributed minimum dominating set approximations in restricted families of graphs
- Power consumption in packet radio networks
- Efficient algorithms for leader election in radio networks
- Adversary immune leader election in ad hoc radio networks
- A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs
- Title not available (Why is that?)
- Algorithms and Computation
- Quasi-optimal energy-efficient leader election algorithms in radio networks
- Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election
- Title not available (Why is that?)
- Contention resolution with log-logstar channel accesses
- A local constant factor MDS approximation for bounded genus graphs
- Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks
- Distributed algorithms for planar networks. II: Low-congestion shortcuts, MST, and Min-Cut
- Planar diameter via metric compression
- Exponential separations in the energy complexity of leader election
- The energy complexity of broadcast
- The Energy Complexity of BFS in Radio Networks
- Minor excluded network families admit fast distributed algorithms
- Weak communication in single‐hop radio networks: adjusting algorithms to industrial standards
- Sleeping is Efficient: MIS in O (1)-rounds Node-averaged Awake Complexity
This page was built for publication: The energy complexity of diameter and minimum cut computation in bounded-genus networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6199403)
