b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs.
Flavia BonomoOliver SchaudtMaya SteinMario Valencia-PabonPublished in: ISCO (2014)
Keyphrases
- bipartite graph
- np hard
- maximum weight
- np complete
- maximum matching
- special case
- minimum weight
- optimal solution
- scheduling problem
- approximation algorithms
- worst case
- graph clustering
- maximum cardinality
- link prediction
- lower bound
- computational complexity
- bipartite graph matching
- constraint satisfaction problems
- minimum cost
- knapsack problem
- greedy heuristic
- bipartite networks
- training data
- branch and bound algorithm
- co occurrence
- web search