COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
From MaRDI portal
Publication:5696908
Recommendations
Cites work
Cited in
(73)- How fast can we reach a target vertex in stochastic temporal graphs?
- Sharp Thresholds in Random Simple Temporal Graphs
- scientific article; zbMATH DE number 7559396 (Why is no real title available?)
- On the expressivity of time-varying graphs
- Searching for black holes in subways
- Temporal reachability minimization: delaying vs. deleting
- Towards classifying the polynomial-time solvability of temporal betweenness centrality
- Blackout-tolerant temporal spanners
- Performance analysis and evaluation of random walk algorithms on wireless networks
- Efficiently testing \(T\)-interval connectivity in dynamic graphs
- Shortest, fastest, and foremost broadcast in dynamic networks
- A study of connectivity on dynamic graphs: computing persistent connected components
- 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
- Temporal vertex cover with a sliding time window
- Deleting edges to restrict the size of an epidemic in temporal networks
- Faster exploration of degree-bounded temporal graphs
- On computing Pareto optimal paths in weighted time-dependent networks
- On short fastest paths in temporal graphs
- Edge-disjoint branchings in temporal digraphs
- Sliding window temporal graph coloring
- Deleting edges to restrict the size of an epidemic in temporal networks
- Temporal vertex cover with a sliding time window
- Consensus in rooted dynamic networks with short-lived stability
- Snapshot disjointness in temporal graphs
- Enabling minimal dominating set in highly dynamic distributed systems
- The complexity of optimal design of temporally connected graphs
- scientific article; zbMATH DE number 1070409 (Why is no real title available?)
- Algorithms – ESA 2004
- 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.
- Temporally connected components
- The complexity of computing optimum labelings for temporal connectivity
- On the treewidth of dynamic graphs
- Exploration of \(k\)-edge-deficient temporal graphs
- Distributed exploration of dynamic rings
- Information spreading in dynamic networks: an analytical approach
- Convergecast tree on temporal graphs
- Coloring temporal graphs
- Temporal cliques admit sparse spanners
- DynamicScore: a novel metric for quantifying graph dynamics
- An introduction to temporal graphs: an algorithmic perspective
- An introduction to temporal graphs: an algorithmic perspective
- Mengerian graphs: characterization and recognition
- Cheapest paths in dynamic networks
- Exploration of \(k\)-edge-deficient temporal graphs
- Edge exploration of temporal graphs
- Mining preserving structures in a graph sequence
- Edge exploration of temporal graphs
- The temporal explorer who returns to the base
- 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 computing optimal temporal branchings and spanning subgraphs
- Temporal matching on geometric graph data
- 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
- Parameterised temporal exploration problems
- Using compressed suffix-arrays for a compact representation of temporal-graphs
- Edge-Disjoint Branchings in Temporal Graphs
- Finding temporal paths under waiting time constraints
- Simple, strict, proper, happy: a study of reachability in temporal graphs
- Self-stabilizing systems in spite of high dynamics
- Temporal cliques admit sparse spanners
- Foremost non-stop journey arrival in linear time
- Invited paper: Simple, strict, proper, happy: a study of reachability in 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)
