Pages that link to "Item:Q5062113"
From MaRDI portal
The following pages link to Target Set Selection in Dense Graph Classes (Q5062113):
Displaying 6 items.
- Graph structured sparse subset selection (Q2662712) (← links)
- Weighted target set selection on trees and cycles (Q6087138) (← links)
- Parameterized complexity for iterated type partitions and modular-width (Q6126724) (← links)
- Getting linear time in graphs of bounded neighborhood diversity (Q6599065) (← links)
- On the complexity of target set selection in simple geometric networks (Q6606994) (← links)
- Parameterized complexity of weighted target set selection (Q6636096) (← links)