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