Pages that link to "Item:Q2684482"

The following pages link to Solving target set selection with bounded thresholds faster than \(2^n\) (Q2684482):

Displaying 9 items.

• Exact solutions for latency-bounded target set selection problem on some special families of graphs (Q260041) (← links)
• Treewidth governs the complexity of target set selection (Q456700) (← links)
• Some results on the target set selection problem (Q1956258) (← links)
• The \(t\)-latency bounded strong target set selection problem in some kinds of special family of graphs (Q2025100) (← links)
• Constant thresholds can make target set selection tractable (Q2254488) (← links)
• Domination and convexity problems in the target set selection model (Q2689641) (← links)
• Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree (Q6045404) (← links)
• Target set selection with maximum activation time (Q6110610) (← links)
• On the complexity of target set selection in simple geometric networks (Q6606994) (← links)