Pages that link to "Item:Q1635713"

The following pages link to Deleting edges to restrict the size of an epidemic: a new application for treewidth (Q1635713):

Displaying 10 items.

• Reducing reachability in temporal graphs: towards a more realistic model of real-world spreading processes (Q2104268) (← links)
• On critical node problems with vulnerable vertices (Q2169985) (← 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)
• Optimizing reachability sets in temporal graphs by delaying (Q2672269) (← links)
• Further parameterized algorithms for the \(\mathcal{F}\)-free edge deletion problem (Q2676471) (← links)
• Deleting Edges to Restrict the Size of an Epidemic: A New Application for Treewidth (Q3467872) (← links)
• (Q5092419) (← links)
• Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs (Q6087215) (← links)
• Multistage \(s-t\) path: confronting similarity with dissimilarity (Q6107891) (← links)