Algorithms and experiments for parameterized approaches to hard graph problems
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Programming involving graphs or networks (90C35)
Recommendations
Cited in
(11)- Fixed-parameter tractability results for feedback set problems in tournaments
- Parameterized algorithms for Graph Burning problem
- Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems
- scientific article; zbMATH DE number 1982181 (Why is no real title available?)
- A Parametrized Analysis of Algorithms on Hierarchical Graphs
- Algorithms for #BIS-hard problems on expander graphs
- Separator-based data reduction for signed graph balancing
- Quadratic kernelization for convex recoloring of trees
- Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications
- Fixed-parameter algorithms for cluster vertex deletion
This page was built for publication: Algorithms and experiments for parameterized approaches to hard graph problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600916)
