b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs.
Flavia BonomoOliver SchaudtMaya SteinMario Valencia-PabonPublished in: CoRR (2013)
Keyphrases
- bipartite graph
- np hard
- maximum weight
- maximum matching
- np complete
- special case
- minimum weight
- scheduling problem
- approximation algorithms
- optimal solution
- lower bound
- computational complexity
- bipartite graph matching
- maximum cardinality
- tree structure
- link prediction
- minimum cost
- constraint satisfaction problems
- branch and bound algorithm
- worst case
- edge weights
- graph clustering
- greedy heuristic
- mutual reinforcement
- information retrieval