Pages that link to "Item:Q2408560"
From MaRDI portal
The following pages link to Parameterized complexity of secluded connectivity problems (Q2408560):
Displaying 7 items.
- The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (Q1756342) (← links)
- Finding connected secluded subgraphs (Q2186823) (← links)
- On the computational complexity of length- and neighborhood-constrained path problems (Q2294439) (← links)
- (Q5111877) (← links)
- Parameterized algorithms and data reduction for the short secluded <i>s</i>‐<i>t</i>‐path problem (Q6068532) (← 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)
