Recognizing tough graphs is NP-hard.
Douglas BauerS. Louis HakimiEdward F. SchmeichelPublished in: Discret. Appl. Math. (1990)
Keyphrases
- np hard
- linear programming
- np complete
- approximation algorithms
- optimal solution
- max cut
- graph theoretic
- minimum cost
- np hardness
- integer programming
- special case
- graph theory
- graph matching
- graph kernels
- structured objects
- directed graph
- closely related
- worst case
- scheduling problem
- lower bound
- greedy approximation algorithm
- set cover
- graph mining
- weighted graph
- automatic recognition
- graph data
- graph clustering
- graph model
- maximum weight
- graph structure
- bipartite graph
- pairwise