Login / Signup
Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations.
Svyatoslav Trukhanov
Chitra Balasubramaniam
Balabhaskar Balasundaram
Sergiy Butenko
Published in:
Comput. Optim. Appl. (2013)
Keyphrases
</>
learning algorithm
maximum clique
data structure
significant improvement
graph theory
worst case
exhaustive search
np hard
graph structures
computational cost
data mining techniques
independent set
frequently occurring
random graphs
dynamic programming
computational complexity
optimal solution
feature selection