A parameterized study of secluded structures in directed graphs
From MaRDI portal
Cites work
- A fixed-parameter algorithm for the directed feedback vertex set problem
- Designing FPT algorithms for cut problems using randomized contractions
- Directed multicut is W[1]-hard, even for four terminal pairs
- Edge-disjoint paths in digraphs with bounded independence number
- Finding \(k\)-secluded trees faster
- Finding connected secluded subgraphs
- Finding topological subgraphs is fixed-parameter tractable
- Fixed-parameter tractability of \textsc{Directed Multicut} with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation
- Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset
- Kernelization of arc disjoint cycle packing in -bounded digraphs
- Minimum bisection is fixed-parameter tractable
- On the computational complexity of length- and neighborhood-constrained path problems
- On the Parameterized Complexity of Cutting a Few Vertices from a Graph
- Parameterized algorithms
- Parameterized algorithms and data reduction for the short secluded s‐t‐path problem
- Parameterized complexity of secluded connectivity problems
- Reducing CMSO model checking to highly connected graphs
- Secluded connectivity problems
- Single-exponential FPT algorithms for enumerating secluded \(\mathcal{F}\)-free subgraphs and deleting to scattered graph classes
- Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number
- The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs
This page was built for publication: A parameterized study of secluded structures in directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7364403)
