Pages that link to "Item:Q2208254"
From MaRDI portal
The following pages link to Assigning times to minimise reachability in temporal graphs (Q2208254):
Displaying 21 items.
- Regular set of representatives for time-constrained MSC graphs (Q436617) (← links)
- Temporal communication graphs: Lamport's process-time graphs augmented for the purpose of mapping and scheduling (Q1208593) (← links)
- Temporal vertex cover with a sliding time window (Q2009637) (← links)
- Reducing reachability in temporal graphs: towards a more realistic model of real-world spreading processes (Q2104268) (← links)
- Deleting edges to restrict the size of an epidemic in temporal networks (Q2662670) (← links)
- Optimizing reachability sets in temporal graphs by delaying (Q2672269) (← links)
- On Temporally Connected Graphs of Small Cost (Q2788993) (← links)
- On efficient vaccine distribution strategy to suppress pandemic using social relation (Q2798324) (← links)
- Symbolically Bounding the Drift in Time-Constrained MSC Graphs (Q2915094) (← links)
- Algorithms for Extracting Timeliness Graphs (Q3569121) (← links)
- As Time Goes By: Reflections on Treewidth for Temporal Graphs (Q5042450) (← links)
- (Q5190778) (← links)
- Automated Technology for Verification and Analysis (Q5491870) (← links)
- On finding separators in temporal split and permutation graphs (Q5918685) (← links)
- On finding separators in temporal split and permutation graphs (Q5925700) (← links)
- Sharp Thresholds in Random Simple Temporal Graphs (Q6131198) (← links)
- Computing maximum matchings in temporal graphs (Q6168321) (← links)
- Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks (Q6179710) (← links)
- Temporal reachability minimization: delaying vs. deleting (Q6564622) (← links)
- Snapshot disjointness in temporal graphs (Q6589845) (← links)
- The complexity of computing optimum labelings for temporal connectivity (Q6615311) (← links)
