Parameterized algorithms for the happy set problem
From MaRDI portal
Recommendations
Cites work
- A fast branching algorithm for cluster vertex deletion
- Algorithmic aspects of homophyly of networks
- Algorithmic meta-theorems for restrictions of treewidth
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- Approximating clique-width and branch-width
- Approximating rank-width and clique-width quickly
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Clustering and domination in perfect graphs
- Complexity and approximability of the happy set problem
- Complexity of finding dense subgraphs
- Exact and approximation algorithms for densest \(k\)-subgraph (extended abstract)
- Finding Branch-Decompositions and Rank-Decompositions
- Finding happiness: an analysis of the maximum happy vertices problem
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- scientific article; zbMATH DE number 6515825 (Why is no real title available?)
- scientific article; zbMATH DE number 26490 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Improved approximation algorithms for the maximum happy vertices and edges problems
- Improved approximation algorithms for the maximum happy vertices and edges problems
- Linear FPT reductions and computational lower bounds
- Linear Time Algorithms for Happy Vertex Coloring Problems for Trees
- Modular decomposition and transitive orientation
- Networks, crowds and markets. Reasoning about a highly connected world.
- On happy colorings, cuts, and structural parameterizations
- On structural parameterizations of happy coloring, empire coloring and boxicity
- On the parameterized complexity of happy vertex coloring
- Parameterized algorithms
- Parameterized algorithms for the happy set problem
- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- The parameterized complexity of happy colorings
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width
- Treewidth. Computations and approximations
- Upper bounds to the clique width of graphs
Cited in
(9)- On the parameterized complexity of happy vertex coloring
- The parameterized complexity of happy colorings
- Complexity and approximability of the happy set problem
- Parameterized algorithms for the happy set problem
- Happy set problem on subclasses of co-comparability graphs
- On \(d\)-stable locally checkable problems parameterized by mim-width
- Happy set problems on cubic graphs and convex bipartite graphs
- Parameterized complexity of maximum happy set and densest k-subgraph
- Parameterized algorithms for d-hitting set: the weighted case
This page was built for publication: Parameterized algorithms for the happy set problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5919103)
