The maximum happy induced subgraph problem: bounds and algorithms
From MaRDI portal
Publication:2026981
DOI10.1016/j.cor.2020.105114OpenAlexW3092242673MaRDI QIDQ2026981
Kerri Morgan, Dhananjay Thiruvady, Rhyd Lewis
Publication date: 21 May 2021
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.105114
Related Items (2)
New algorithms for a simple measure of network partitioning ⋮ New algorithms for a simple measure of network partitioning
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
- Algorithmic aspects of homophyly of networks
- On the phase transitions of random \(k\)-constraint satisfaction problems
- Parameterized graph separation problems
- Graph coloring with adaptive evolutionary algorithms
- Finding happiness: an analysis of the maximum happy vertices problem
- The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut
- An experimental analysis of simple, distributed vertex coloring algorithms
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- Linear Time Algorithms for Happy Vertex Coloring Problems for Trees
- Cluster Analysis
- A Guide to Graph Colouring
- Generating Random Regular Graphs Quickly
- Multiway cuts in node weighted graphs
- Collective dynamics of ‘small-world’ networks
This page was built for publication: The maximum happy induced subgraph problem: bounds and algorithms
