Using out-of-core techniques to produce exact solutions to the maximum clique problem on extremely large graphs.
Gary L. RogersAndy D. PerkinsCharles A. PhillipsJohn D. EblenFaisal N. Abu-KhzamMichael A. LangstonPublished in: AICCSA (2009)
Keyphrases
- maximum clique
- graph matching
- graph theory
- branch and bound algorithm
- directed graph
- weighted graph
- structured objects
- graph representation
- neural network
- simulated annealing
- knn
- optimal solution
- data sets
- graph mining
- graph model
- graph databases
- spanning tree
- graph partitioning
- case study
- graph clustering
- graph construction
- machine learning