Maximizing happiness in graphs of bounded clique-width
From MaRDI portal
Publication:2081605
DOI10.1007/978-3-030-61792-9_8OpenAlexW3116493424MaRDI QIDQ2081605
Ivan A. Bliznets, Danil Sagunov
Publication date: 13 October 2022
Full work available at URL: https://arxiv.org/abs/2003.04605
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Related Items (3)
On \(d\)-stable locally checkable problems parameterized by mim-width ⋮ New algorithms for a simple measure of network partitioning ⋮ The maximum happy induced subgraph problem: bounds and algorithms
Recommendations
- Finding happiness: an analysis of the maximum happy vertices problem 👍 👎
- Improved approximation algorithms for the maximum happy vertices and edges problems 👍 👎
- On the approximability of clique and related maximization problems 👍 👎
- Graph classes and approximability of the happy set problem 👍 👎
- Tackling the maximum happy vertices problem in large networks 👍 👎
- The maximum happy induced subgraph problem: bounds and algorithms 👍 👎
- Approximation algorithms for vertex happiness 👍 👎
- Bounding clique-width via perfect graphs 👍 👎
- Bounding Clique-Width via Perfect Graphs 👍 👎
- Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems 👍 👎
This page was built for publication: Maximizing happiness in graphs of bounded clique-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2081605)
