Temporal queries for dynamic temporal forests

DOI10.4230/LIPICS.ISAAC.2024.11MaRDI QIDQ7260621zbMATH OpenFDO

Authors D. Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Alessandro Straziota

Publication date 8 June 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ISAAC.2024.11

zbMATH Keywords

dynamic forestsearliest arrivallatest departuretemporal graphstemporal reachability

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A data structure for dynamic trees
• Blackout-tolerant temporal spanners
• Connectivity and inference problems for temporal networks
• Finding temporal paths under waiting time constraints
• Fully dynamic connectivity in \(O(\log n(\log\log n)^2)\) amortized expected time
• How fast can we reach a target vertex in stochastic temporal graphs?
• scientific article; zbMATH DE number 1512678 (Why is no real title available?)
• Maintaining information in fully dynamic trees with top trees
• Parameterised temporal exploration problems
• Priority Search Trees
• Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide
• Sharp Thresholds in Random Simple Temporal Graphs
• Sparse temporal spanners with low stretch
• Temporal cliques admit sparse spanners
• Temporal vertex cover with a sliding time window
• Two moves per time step make a difference

This page was built for publication: Temporal queries for dynamic temporal forests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7260621)