Fixed-parameter algorithms for cardinality-constrained graph partitioning problems on sparse graphs
From MaRDI portal
Planar graphs; geometric and topological aspects of graph theory (05C10) Signed and weighted graphs (05C22) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cites work
- k-Degenerate Graphs
- A c^k n 5-approximation algorithm for treewidth
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
- Approximation algorithms for connected maximum cut and related problems
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
- Computing densest \(k\)-subgraph with structural parameters
- Computing the largest bond and the maximum connected cut of a graph
- Covering many (or few) edges with \(k\) vertices in sparse graphs
- Efficient computation of representative families with applications in parameterized and exact algorithms
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem
- Fixed-parameter algorithms for cardinality-constrained graph partitioning problems on sparse graphs
- FPT approximation and subexponential algorithms for covering few or many edges
- scientific article; zbMATH DE number 26490 (Why is no real title available?)
- Implicit branching and parameterized partial cover problems
- Mim-width. II. The feedback vertex set problem
- Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization
- On problem kernels for possible winner determination under the k-approval protocol
- Parameterized algorithms
- Parameterized algorithms for graph partitioning problems
- Partial vertex cover on graphs of bounded degeneracy
- Research in Computational Molecular Biology
- Smallest-last ordering and clustering and graph coloring algorithms
- Subexponential algorithms for partial cover problems
- Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering
- The Rectilinear Steiner Tree Problem is NP-Complete
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width
This page was built for publication: Fixed-parameter algorithms for cardinality-constrained graph partitioning problems on sparse graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6965763)
