The maximum happy induced subgraph problem: Bounds and algorithms.
Rhyd LewisDhananjay R. ThiruvadyKerri MorganPublished in: Comput. Oper. Res. (2021)
Keyphrases
- computational cost
- data structure
- error bounds
- computationally efficient
- average case
- worst case
- significant improvement
- theoretical analysis
- multi class
- genetic algorithm
- orders of magnitude
- computational efficiency
- query processing
- graph theory
- upper and lower bounds
- computational complexity
- randomized algorithms