Pages that link to "Item:Q5856438"
From MaRDI portal
The following pages link to An Introduction to Temporal Graphs: An Algorithmic Perspective<sup>*</sup> (Q5856438):
Displaying 50 items.
- Exploration of the \(T\)-interval-connected dynamic graphs: the case of the ring (Q722206) (← links)
- Temporal communication graphs: Lamport's process-time graphs augmented for the purpose of mapping and scheduling (Q1208593) (← links)
- On exploring always-connected temporal graphs of small pathwidth (Q1628692) (← links)
- Temporal network optimization subject to connectivity constraints (Q1739101) (← links)
- The complexity of routing with collision avoidance (Q1741493) (← links)
- Finding temporal paths under waiting time constraints (Q1979453) (← links)
- The complexity of finding small separators in temporal graphs (Q2009634) (← links)
- Temporal vertex cover with a sliding time window (Q2009637) (← links)
- Exploration of dynamic cactuses with sub-logarithmic overhead (Q2035475) (← links)
- Sliding window temporal graph coloring (Q2037193) (← links)
- The complexity of finding temporal separators under waiting time constraints (Q2059911) (← links)
- Königsberg sightseeing: Eulerian walks in temporal graphs (Q2115887) (← links)
- Mengerian temporal graphs revisited (Q2140509) (← links)
- Using compressed suffix-arrays for a compact representation of temporal-graphs (Q2200556) (← links)
- Graph stories in small area (Q2206885) (← links)
- Assigning times to minimise reachability in temporal graphs (Q2208254) (← links)
- Edge-disjoint branchings in temporal digraphs (Q2236804) (← links)
- Coloring temporal graphs (Q2237899) (← links)
- Cover time in edge-uniform stochastically-evolving graphs (Q2283819) (← links)
- On computing Pareto optimal paths in weighted time-dependent networks (Q2656351) (← links)
- The network-untangling problem: from interactions to activity timelines (Q2659278) (← links)
- On temporal graph exploration (Q2662667) (← links)
- A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs (Q2664011) (← links)
- Optimizing reachability sets in temporal graphs by delaying (Q2672269) (← links)
- Eulerian walks in temporal graphs (Q2689257) (← links)
- Parameterised temporal exploration problems (Q2698289) (← links)
- A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity (Q3297755) (← links)
- Algorithms for Extracting Timeliness Graphs (Q3569121) (← links)
- Faster exploration of degree-bounded temporal graphs (Q5005137) (← links)
- The Complexity of Finding Small Separators in Temporal Graphs (Q5005147) (← links)
- Edge-Disjoint Branchings in Temporal Graphs (Q5041184) (← links)
- (Q5089189) (← links)
- Cluster Editing in Multi-Layer and Temporal Graphs. (Q5091014) (← links)
- (Q5092344) (← links)
- Non-strict Temporal Exploration (Q5100955) (← links)
- Cops and Robbers on Dynamic Graphs: Offline and Online Case (Q5100960) (← links)
- Graph Stories in Small Area (Q5119379) (← links)
- Temporal graph classes: a view through temporal separators (Q5915590) (← links)
- Feedback edge sets in temporal graphs (Q5918410) (← links)
- Edge exploration of temporal graphs (Q5918622) (← links)
- Edge exploration of temporal graphs (Q5925630) (← links)
- Temporal interval cliques and independent sets (Q6039892) (← links)
- Expansion and flooding in dynamic random networks with node churn (Q6051059) (← links)
- Finding Temporal Paths Under Waiting Time Constraints. (Q6065432) (← links)
- Mengerian graphs: characterization and recognition (Q6078288) (← links)
- Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs (Q6087215) (← links)
- A study of connectivity on dynamic graphs: computing persistent connected components (Q6097848) (← links)
- Multistage \(s-t\) path: confronting similarity with dissimilarity (Q6107891) (← links)
- The complexity of growing a graph (Q6112002) (← links)
- Blackout-tolerant temporal spanners (Q6141041) (← links)