Hitting geodesic intervals in structurally restricted graphs
From MaRDI portal
Cites work
- An improved parameterized algorithm for the minimum node multiway cut problem
- Computational Complexity of Geodetic Set
- Fast approximation algorithms for piercing boxes by points
- Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset
- Fundamentals of parameterized complexity
- Geodetic sets in graphs
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 969092 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- scientific article; zbMATH DE number 7646025 (Why is no real title available?)
- Intersection Theorems for Systems of Sets
- Modular decomposition and transitive orientation
- Multicut Is FPT
- On structural parameterizations of Hitting Set: hitting paths in graphs using 2-SAT
- On the computational complexity of vertex integrity and component order connectivity
- Optimal packing and covering in the plane are NP-complete
- Parameterized algorithms
- Parameterized complexity of geodetic set
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
- Parameterized graph separation problems
- Parametrized complexity theory.
- Steiner tree parameterized by multiway cut and even less
- The geodetic number of a graph
- The parameterized complexity of terminal monitoring set
This page was built for publication: Hitting geodesic intervals in structurally restricted graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7356359)
