b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs.
Flavia BonomoOliver SchaudtMaya SteinMario Valencia-PabonPublished in: Algorithmica (2015)
Keyphrases
- bipartite graph
- np hard
- maximum weight
- special case
- np complete
- minimum weight
- maximum matching
- lower bound
- scheduling problem
- approximation algorithms
- graph clustering
- branch and bound algorithm
- computational complexity
- bipartite graph matching
- optimal solution
- link prediction
- greedy heuristic
- minimum cost
- maximum cardinality
- edge weights
- knapsack problem
- tree structure
- information retrieval systems
- constraint satisfaction problems
- worst case
- affinity graph
- pairwise