COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS

DOI10.1142/S0129054103001728zbMATH Open1075.68545MaRDI QIDQ5696908FDOQ5696908

Authors:

Publication date: 19 October 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Recommendations

• Shortest, fastest, and foremost broadcast in dynamic networks
• Shortest paths on dynamic graphs
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Dynamic shortest path problems with time-varying costs
• Dynamic shortest paths minimizing travel times and costs

zbMATH Keywords

dynamic networksroutinggraph theoretical modelsevolving graphsfixed-schedule dynamic networksleo satellite networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Shortest path with time constraints on movement and parking

Cited In (76)

• How fast can we reach a target vertex in stochastic temporal graphs?
• On the expressivity of time-varying graphs
• Temporal graph classes: a view through temporal separators
• Performance analysis and evaluation of random walk algorithms on wireless networks
• A study of connectivity on dynamic graphs: computing persistent connected components
• Towards classifying the polynomial-time solvability of temporal betweenness centrality
• Efficiently testing \(T\)-interval connectivity in dynamic graphs
• Searching for black holes in subways
• Shortest, fastest, and foremost broadcast in dynamic networks
• Modeling tripartite entanglement in quantum protocols using evolving entangled hypergraphs
• Computing parameters of sequence-based dynamic graphs
• Traveling salesman problems in temporal graphs
• A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs
• Faster exploration of degree-bounded temporal graphs
• Deleting edges to restrict the size of an epidemic in temporal networks
• Deleting edges to restrict the size of an epidemic in temporal networks
• Temporal vertex cover with a sliding time window
• On computing Pareto optimal paths in weighted time-dependent networks
• Temporal vertex cover with a sliding time window
• On short fastest paths in temporal graphs
• Edge-disjoint branchings in temporal digraphs
• Sliding window temporal graph coloring
• Consensus in rooted dynamic networks with short-lived stability
• Enabling minimal dominating set in highly dynamic distributed systems
• Self-stabilizing robots in highly dynamic environments
• Algorithms – ESA 2004
• Title not available (Why is that?)
• The complexity of optimal design of temporally connected graphs
• On finding separators in temporal split and permutation graphs
• On finding separators in temporal split and permutation graphs
• On verifying and maintaining connectivity of interval temporal networks
• Finding Temporal Paths Under Waiting Time Constraints.
• Information spreading in dynamic networks: an analytical approach
• Convergecast tree on temporal graphs
• Distributed exploration of dynamic rings
• On the treewidth of dynamic graphs
• Coloring temporal graphs
• Temporal cliques admit sparse spanners
• An introduction to temporal graphs: an algorithmic perspective
• An introduction to temporal graphs: an algorithmic perspective
• Cheapest paths in dynamic networks
• Edge exploration of temporal graphs
• The temporal explorer who returns to the base
• Mining preserving structures in a graph sequence
• Temporal network optimization subject to connectivity constraints
• Mengerian temporal graphs revisited
• Maximum 0-1 timed matching on temporal graphs
• Shortest Journeys in Directed Temporal Graphs
• Non-strict Temporal Exploration
• On temporal graph exploration
• Temporal matching on geometric graph data
• Parameterised temporal exploration problems
• Edge-Disjoint Branchings in Temporal Graphs
• Self-stabilizing systems in spite of high dynamics
• Using compressed suffix-arrays for a compact representation of temporal-graphs
• Finding temporal paths under waiting time constraints
• Foremost non-stop journey arrival in linear time
• Temporal cliques admit sparse spanners
• Title not available (Why is that?)
• Temporal reachability minimization: delaying vs. deleting
• Blackout-tolerant temporal spanners
• Snapshot disjointness in temporal graphs
• Temporally connected components
• The complexity of computing optimum labelings for temporal connectivity
• Exploration of \(k\)-edge-deficient temporal graphs
• DynamicScore: a novel metric for quantifying graph dynamics
• Mengerian graphs: characterization and recognition
• Exploration of \(k\)-edge-deficient temporal graphs
• Edge exploration of temporal graphs
• On computing optimal temporal branchings and spanning subgraphs
• Computing Betweenness Centrality in Link Streams
• Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality
• A general label setting algorithm and tractability analysis for the multiobjective temporal shortest path problem
• Simple, strict, proper, happy: a study of reachability in temporal graphs
• Invited paper: Simple, strict, proper, happy: a study of reachability in temporal graphs
• Sharp Thresholds in Random Simple Temporal Graphs

This page was built for publication: COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS

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