Pages that link to "Item:Q5696908"
From MaRDI portal
The following pages link to COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS (Q5696908):
Displaying 50 items.
- Traveling salesman problems in temporal graphs (Q284573) (← links)
- Mining preserving structures in a graph sequence (Q344786) (← links)
- Searching for black holes in subways (Q692936) (← links)
- On the treewidth of dynamic graphs (Q744102) (← links)
- Temporal network optimization subject to connectivity constraints (Q1739101) (← links)
- Finding temporal paths under waiting time constraints (Q1979453) (← links)
- Computing parameters of sequence-based dynamic graphs (Q1999994) (← links)
- Temporal vertex cover with a sliding time window (Q2009637) (← links)
- Consensus in rooted dynamic networks with short-lived stability (Q2010603) (← links)
- Sliding window temporal graph coloring (Q2037193) (← links)
- Temporal cliques admit sparse spanners (Q2040022) (← links)
- Foremost non-stop journey arrival in linear time (Q2097355) (← links)
- Mengerian temporal graphs revisited (Q2140509) (← links)
- Maximum 0-1 timed matching on temporal graphs (Q2161255) (← links)
- Distributed exploration of dynamic rings (Q2174251) (← links)
- How fast can we reach a target vertex in stochastic temporal graphs? (Q2194859) (← links)
- Using compressed suffix-arrays for a compact representation of temporal-graphs (Q2200556) (← links)
- On short fastest paths in temporal graphs (Q2232230) (← links)
- Edge-disjoint branchings in temporal digraphs (Q2236804) (← links)
- Coloring temporal graphs (Q2237899) (← links)
- On the expressivity of time-varying graphs (Q2348032) (← links)
- The complexity of optimal design of temporally connected graphs (Q2408566) (← links)
- On computing Pareto optimal paths in weighted time-dependent networks (Q2656351) (← links)
- On temporal graph exploration (Q2662667) (← links)
- Deleting edges to restrict the size of an epidemic in temporal networks (Q2662670) (← links)
- A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs (Q2664011) (← links)
- Towards classifying the polynomial-time solvability of temporal betweenness centrality (Q2672438) (← links)
- Temporal matching on geometric graph data (Q2692739) (← links)
- Parameterised temporal exploration problems (Q2698289) (← links)
- Efficiently Testing $$T$$-Interval Connectivity in Dynamic Graphs (Q2947012) (← links)
- Shortest, Fastest, and Foremost Broadcast in Dynamic Networks (Q2947805) (← links)
- An Introduction to Temporal Graphs: An Algorithmic Perspective (Q3464477) (← links)
- (Q4356887) (← links)
- Cheapest paths in dynamic networks (Q4565769) (← links)
- Modeling tripartite entanglement in quantum protocols using evolving entangled hypergraphs (Q4620274) (← links)
- PERFORMANCE ANALYSIS AND EVALUATION OF RANDOM WALK ALGORITHMS ON WIRELESS NETWORKS (Q4902878) (← links)
- Convergecast Tree on Temporal Graphs (Q4983547) (← links)
- Temporal Vertex Cover with a Sliding Time Window (Q5002837) (← links)
- (Q5005137) (← links)
- Edge-Disjoint Branchings in Temporal Graphs (Q5041184) (← links)
- On Verifying and Maintaining Connectivity of Interval Temporal Networks (Q5087856) (← links)
- (Q5089189) (← links)
- Temporal Cliques Admit Sparse Spanners (Q5092337) (← links)
- (Q5092419) (← links)
- Non-strict Temporal Exploration (Q5100955) (← links)
- Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems (Q5207898) (← links)
- Information Spreading in Dynamic Networks: An Analytical Approach (Q5391131) (← links)
- Algorithms – ESA 2004 (Q5464616) (← links)
- An Introduction to Temporal Graphs: An Algorithmic Perspective<sup>*</sup> (Q5856438) (← links)
- Exploration of \(k\)-edge-deficient temporal graphs (Q5896891) (← links)
