COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
From MaRDI portal
Publication:5696908
DOI10.1142/S0129054103001728zbMath1075.68545MaRDI QIDQ5696908
No author found.
Publication date: 19 October 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
routingdynamic networksgraph theoretical modelsevolving graphsfixed-schedule dynamic networksleo satellite networks
Related Items (66)
Edge-Disjoint Branchings in Temporal Graphs ⋮ Traveling salesman problems in temporal graphs ⋮ Mengerian temporal graphs revisited ⋮ An Introduction to Temporal Graphs: An Algorithmic Perspective ⋮ Mining preserving structures in a graph sequence ⋮ Maximum 0-1 timed matching on temporal graphs ⋮ On computing Pareto optimal paths in weighted time-dependent networks ⋮ On temporal graph exploration ⋮ Deleting edges to restrict the size of an epidemic in temporal networks ⋮ Distributed exploration of dynamic rings ⋮ A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs ⋮ On Verifying and Maintaining Connectivity of Interval Temporal Networks ⋮ The complexity of optimal design of temporally connected graphs ⋮ Efficiently Testing $$T$$-Interval Connectivity in Dynamic Graphs ⋮ Towards classifying the polynomial-time solvability of temporal betweenness centrality ⋮ Shortest, Fastest, and Foremost Broadcast in Dynamic Networks ⋮ Non-strict Temporal Exploration ⋮ Shortest Journeys in Directed Temporal Graphs ⋮ Mengerian graphs: characterization and recognition ⋮ A study of connectivity on dynamic graphs: computing persistent connected components ⋮ Self-stabilizing systems in spite of high dynamics ⋮ Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality ⋮ Computing Betweenness Centrality in Link Streams ⋮ Simple, strict, proper, happy: a study of reachability in temporal graphs ⋮ Blackout-tolerant temporal spanners ⋮ Sharp Thresholds in Random Simple Temporal Graphs ⋮ How fast can we reach a target vertex in stochastic temporal graphs? ⋮ Invited paper: Simple, strict, proper, happy: a study of reachability in temporal graphs ⋮ Unnamed Item ⋮ Using compressed suffix-arrays for a compact representation of temporal-graphs ⋮ Temporal matching on geometric graph data ⋮ Parameterised temporal exploration problems ⋮ Modeling tripartite entanglement in quantum protocols using evolving entangled hypergraphs ⋮ Information Spreading in Dynamic Networks: An Analytical Approach ⋮ On short fastest paths in temporal graphs ⋮ Temporal Vertex Cover with a Sliding Time Window ⋮ Finding temporal paths under waiting time constraints ⋮ Temporal network optimization subject to connectivity constraints ⋮ Exploration of \(k\)-edge-deficient temporal graphs ⋮ Edge-disjoint branchings in temporal digraphs ⋮ PERFORMANCE ANALYSIS AND EVALUATION OF RANDOM WALK ALGORITHMS ON WIRELESS NETWORKS ⋮ Coloring temporal graphs ⋮ Finding Temporal Paths Under Waiting Time Constraints. ⋮ Computing parameters of sequence-based dynamic graphs ⋮ Searching for black holes in subways ⋮ Exploration of \(k\)-edge-deficient temporal graphs ⋮ Temporal vertex cover with a sliding time window ⋮ Consensus in rooted dynamic networks with short-lived stability ⋮ Unnamed Item ⋮ Temporal graph classes: a view through temporal separators ⋮ Unnamed Item ⋮ Sliding window temporal graph coloring ⋮ Temporal cliques admit sparse spanners ⋮ Self-stabilizing robots in highly dynamic environments ⋮ Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems ⋮ The temporal explorer who returns to the base ⋮ Edge exploration of temporal graphs ⋮ On finding separators in temporal split and permutation graphs ⋮ On the treewidth of dynamic graphs ⋮ Edge exploration of temporal graphs ⋮ On finding separators in temporal split and permutation graphs ⋮ Temporal Cliques Admit Sparse Spanners ⋮ Convergecast Tree on Temporal Graphs ⋮ An Introduction to Temporal Graphs: An Algorithmic Perspective* ⋮ Foremost non-stop journey arrival in linear time ⋮ On the expressivity of time-varying graphs
Cites Work
This page was built for publication: COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
