Pages that link to "Item:Q2186823"
From MaRDI portal
The following pages link to Finding connected secluded subgraphs (Q2186823):
Displaying 5 items.
- The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (Q1756342) (← links)
- Parameterized complexity of secluded connectivity problems (Q2408560) (← links)
- Finding \(k\)-secluded trees faster (Q6039423) (← links)
- Finding \(k\)-secluded trees faster (Q6133646) (← links)
- Single-exponential FPT algorithms for enumerating secluded \(\mathcal{F}\)-free subgraphs and deleting to scattered graph classes (Q6655669) (← links)