Total colouring regular bipartite graphs is NP-hard.
Colin J. H. McDiarmidAbdón Sánchez-ArroyoPublished in: Discret. Math. (1994)
Keyphrases
- bipartite graph
- np hard
- maximum weight
- maximum matching
- minimum weight
- optimal solution
- bipartite graph matching
- special case
- scheduling problem
- approximation algorithms
- lower bound
- computational complexity
- link prediction
- np complete
- maximum cardinality
- graph clustering
- minimum cost
- mutual reinforcement
- constraint satisfaction problems
- greedy heuristic
- information retrieval
- data sets
- supervised learning
- semi supervised
- decision trees