Recognizing Tenacious Graphs Is NP-Hard.
Seyed Morteza DadvandDara MoazzamiAli MoeiniPublished in: Ars Comb. (2014)
Keyphrases
- np hard
- optimal solution
- approximation algorithms
- max cut
- special case
- greedy approximation algorithm
- scheduling problem
- graph theory
- greedy heuristic
- branch and bound algorithm
- worst case
- computational complexity
- lower bound
- graph matching
- graph representation
- computationally challenging
- integer programming
- series parallel
- np hardness
- automatic recognition
- remains np hard
- maximum weight
- graph partitioning
- graph mining
- genetic algorithm
- closely related
- weighted graph
- graph theoretic
- graph clustering
- random graphs
- dynamic programming
- graph structure
- bipartite graph
- np complete
- directed graph
- structured data