COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
From MaRDI portal
Recommendations
Cites work
Cited in
(94)- Temporal network optimization subject to connectivity constraints
- Finding temporal paths under waiting time constraints
- Computing parameters of sequence-based dynamic graphs
- Temporal vertex cover with a sliding time window
- Consensus in rooted dynamic networks with short-lived stability
- Sliding window temporal graph coloring
- Temporal cliques admit sparse spanners
- Foremost non-stop journey arrival in linear time
- Mengerian temporal graphs revisited
- Maximum 0-1 timed matching on temporal graphs
- Distributed exploration of dynamic rings
- How fast can we reach a target vertex in stochastic temporal graphs?
- Using compressed suffix-arrays for a compact representation of temporal-graphs
- On short fastest paths in temporal graphs
- Edge-disjoint branchings in temporal digraphs
- Coloring temporal graphs
- On the expressivity of time-varying graphs
- The complexity of optimal design of temporally connected graphs
- On computing Pareto optimal paths in weighted time-dependent networks
- Deleting edges to restrict the size of an epidemic in temporal networks
- A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs
- Towards classifying the polynomial-time solvability of temporal betweenness centrality
- Temporal matching on geometric graph data
- Parameterised temporal exploration problems
- Traveling salesman problems in temporal graphs
- Efficiently testing T-interval connectivity in dynamic graphs
- Shortest, fastest, and foremost broadcast in dynamic networks
- Mining preserving structures in a graph sequence
- An introduction to temporal graphs: an algorithmic perspective
- scientific article; zbMATH DE number 1070409 (Why is no real title available?)
- Cheapest paths in dynamic networks
- Modeling tripartite entanglement in quantum protocols using evolving entangled hypergraphs
- Performance analysis and evaluation of random walk algorithms on wireless networks
- Convergecast tree on temporal graphs
- Temporal vertex cover with a sliding time window
- Faster exploration of degree-bounded temporal graphs
- Edge-Disjoint Branchings in Temporal Graphs
- On verifying and maintaining connectivity of interval temporal networks
- scientific article; zbMATH DE number 7559396 (Why is no real title available?)
- Temporal cliques admit sparse spanners
- Deleting edges to restrict the size of an epidemic in temporal networks
- Non-strict Temporal Exploration
- Enabling minimal dominating set in highly dynamic distributed systems
- Information spreading in dynamic networks: an analytical approach
- Algorithms – ESA 2004
- An introduction to temporal graphs: an algorithmic perspective
- Exploration of \(k\)-edge-deficient temporal graphs
- The temporal explorer who returns to the base
- Edge exploration of temporal graphs
- On finding separators in temporal split and permutation graphs
- Exploration of k-edge-deficient temporal graphs
- Edge exploration of temporal graphs
- On finding separators in temporal split and permutation graphs
- Finding Temporal Paths Under Waiting Time Constraints.
- 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
- Sharp Thresholds in Random Simple Temporal Graphs
- Blackout-tolerant temporal spanners
- Invited paper: Simple, strict, proper, happy: a study of reachability in temporal graphs
- Temporal reachability minimization: delaying vs. deleting
- Snapshot disjointness in temporal graphs
- Temporally connected components
- The complexity of computing optimum labelings for temporal connectivity
- DynamicScore: a novel metric for quantifying graph dynamics
- On computing optimal temporal branchings and spanning subgraphs
- A general label setting algorithm and tractability analysis for the multiobjective temporal shortest path problem
- Parameterized restless temporal path
- Finding a minimum source set in temporal graphs
- Temporal graph realization from fastest paths
- On time-travel planning in dynamic graphs
- Making the interval membership width of temporal graphs connected and bidirectional
- Searching for black holes in subways
- Parameterized algorithms for multi-label periodic temporal graph realization
- Temporal separators with deadlines
- Counting temporal paths
- When should you wait before updating? -- Toward a robustness refinement
- The complexity of transitively orienting temporal graphs
- Forbidden patterns in temporal graphs resulting from encounters in a corridor
- Making the interval membership width of temporal graphs connected and bidirectional
- Algorithms and complexity for path covers of temporal DAGs
- How to reduce temporal cliques to find sparse spanners
- Temporal connectivity: coping with foreseen and unforeseen delays
- The dynamic Steiner tree problem: definitions, complexity, algorithms
- Efficient computation of f-centralities and nonbacktracking centrality for temporal networks
- Self-stabilizing mutual exclusion in dynamic networks with bounded temporal diameter
- Reachability in temporal graphs under perturbation
- Recognizing and realizing temporal reachability graphs
- The shortest temporal exploration problem
- On the treewidth of dynamic 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)
