Pages that link to "Item:Q2662670"
From MaRDI portal
The following pages link to Deleting edges to restrict the size of an epidemic in temporal networks (Q2662670):
Displaying 22 items.
- Edge removal in random contact networks and the basic reproduction number (Q353087) (← links)
- Optimal link removal for epidemic mitigation: A two-way partitioning approach (Q423087) (← links)
- An edge deletion model for complex networks (Q719248) (← links)
- Preferential deletion in dynamic models of web-like networks (Q845994) (← links)
- Deleting edges to restrict the size of an epidemic: a new application for treewidth (Q1635713) (← links)
- Finding temporal paths under waiting time constraints (Q1979453) (← links)
- Reducing reachability in temporal graphs: towards a more realistic model of real-world spreading processes (Q2104268) (← links)
- Distributed computation and reconfiguration in actively dynamic networks (Q2121068) (← links)
- Assigning times to minimise reachability in temporal graphs (Q2208254) (← links)
- Optimizing reachability sets in temporal graphs by delaying (Q2672269) (← links)
- On finding separators in temporal split and permutation graphs (Q5918685) (← links)
- Edge exploration of temporal graphs (Q5925630) (← links)
- On finding separators in temporal split and permutation graphs (Q5925700) (← links)
- Finding Temporal Paths Under Waiting Time Constraints. (Q6065432) (← links)
- Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs (Q6087215) (← links)
- Multistage \(s-t\) path: confronting similarity with dissimilarity (Q6107891) (← links)
- The complexity of growing a graph (Q6112002) (← links)
- Temporal reachability minimization: delaying vs. deleting (Q6564622) (← links)
- The complexity of computing optimum labelings for temporal connectivity (Q6615311) (← links)
- The complexity of growing a graph (Q6627045) (← links)
- A general label setting algorithm and tractability analysis for the multiobjective temporal shortest path problem (Q6663968) (← links)
- Payment scheduling in the interval debt model (Q6664057) (← links)