Convergecast Tree on Temporal Graphs
From MaRDI portal
Publication:4983547
DOI10.1142/S012905412050015XzbMath1458.68143OpenAlexW3023520383MaRDI QIDQ4983547
Subhrangsu Mandal, Arobinda Gupta
Publication date: 20 April 2021
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s012905412050015x
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)
Related Items (1)
Cites Work
- Unnamed Item
- Time-varying network optimization.
- The complexity of data aggregation in static and dynamic wireless sensor networks
- Aggregation in dynamic networks
- An A* Algorithm Framework for the Point-to-Point Time-Dependent Shortest Path Problem
- Temporal Network Optimization Subject to Connectivity Constraints
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- Connectivity and inference problems for temporal networks
This page was built for publication: Convergecast Tree on Temporal Graphs