Pages that link to "Item:Q2672269"
From MaRDI portal
The following pages link to Optimizing reachability sets in temporal graphs by delaying (Q2672269):
Displaying 12 items.
- Regular set of representatives for time-constrained MSC graphs (Q436617) (← links)
- Reducing reachability in temporal graphs: towards a more realistic model of real-world spreading processes (Q2104268) (← links)
- Assigning times to minimise reachability in temporal graphs (Q2208254) (← links)
- Some optimization problems for timed marked graphs (Q4763829) (← links)
- As Time Goes By: Reflections on Treewidth for Temporal Graphs (Q5042450) (← links)
- (Q5190778) (← links)
- Disentangling the computational complexity of network untangling (Q6151149) (← links)
- Invited paper: Simple, strict, proper, happy: a study of reachability in temporal graphs (Q6155232) (← links)
- On computing optimal temporal branchings (Q6546587) (← links)
- Temporal reachability minimization: delaying vs. deleting (Q6564622) (← links)
- The complexity of computing optimum labelings for temporal connectivity (Q6615311) (← links)
- On computing optimal temporal branchings and spanning subgraphs (Q6655668) (← links)