Pages that link to "Item:Q4598293"
From MaRDI portal
The following pages link to On the Size and the Approximability of Minimum Temporally Connected Subgraphs (Q4598293):
Displaying 20 items.
- Finding temporal paths under waiting time constraints (Q1979453) (← links)
- The complexity of finding small separators in temporal graphs (Q2009634) (← links)
- Temporal cliques admit sparse spanners (Q2040022) (← links)
- Coloring temporal graphs (Q2237899) (← links)
- On Temporally Connected Graphs of Small Cost (Q2788993) (← links)
- The Complexity of Finding Small Separators in Temporal Graphs (Q5005147) (← links)
- As Time Goes By: Reflections on Treewidth for Temporal Graphs (Q5042450) (← links)
- Temporal Cliques Admit Sparse Spanners (Q5092337) (← 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)
- Finding Temporal Paths Under Waiting Time Constraints. (Q6065432) (← links)
- Simple, strict, proper, happy: a study of reachability in temporal graphs (Q6122608) (← links)
- Sharp Thresholds in Random Simple Temporal Graphs (Q6131198) (← links)
- Blackout-tolerant temporal spanners (Q6141041) (← links)
- Invited paper: Simple, strict, proper, happy: a study of reachability in temporal graphs (Q6155232) (← links)
- Computing maximum matchings in temporal graphs (Q6168321) (← links)
- Temporal reachability minimization: delaying vs. deleting (Q6564622) (← links)
- The complexity of computing optimum labelings for temporal connectivity (Q6615311) (← links)