Pages that link to "Item:Q2408566"
From MaRDI portal
The following pages link to The complexity of optimal design of temporally connected graphs (Q2408566):
Displaying 32 items.
- Temporal network optimization subject to connectivity constraints (Q1739101) (← 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)
- Sliding window temporal graph coloring (Q2037193) (← links)
- Temporal cliques admit sparse spanners (Q2040022) (← links)
- How fast can we reach a target vertex in stochastic temporal graphs? (Q2194859) (← links)
- Assigning times to minimise reachability in temporal graphs (Q2208254) (← links)
- Deleting edges to restrict the size of an epidemic in temporal networks (Q2662670) (← links)
- On Temporally Connected Graphs of Small Cost (Q2788993) (← links)
- (Q4290919) (← links)
- Trading Space for Time in Undirected <i>s</i>-<i>t</i> Connectivity (Q4291560) (← links)
- Some optimization problems for timed marked graphs (Q4763829) (← links)
- Temporal Vertex Cover with a Sliding Time Window (Q5002837) (← links)
- How fast can we reach a target vertex in stochastic temporal graphs (Q5092333) (← links)
- Temporal Cliques Admit Sparse Spanners (Q5092337) (← links)
- (Q5092344) (← links)
- (Q5092419) (← links)
- Temporal Network Optimization Subject to Connectivity Constraints (Q5327473) (← links)
- Temporal graph classes: a view through temporal separators (Q5915590) (← links)
- The temporal explorer who returns to the base (Q5918316) (← 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)
- Invited paper: Simple, strict, proper, happy: a study of reachability in temporal graphs (Q6155232) (← links)
- Computing maximum matchings in temporal graphs (Q6168321) (← links)
- Temporally connected components (Q6612544) (← links)
- The complexity of computing optimum labelings for temporal connectivity (Q6615311) (← links)
- On computing optimal temporal branchings and spanning subgraphs (Q6655668) (← links)
