Local Search for Maximum Vertex Weight Clique on Large Sparse Graphs with Efficient Data Structures.
Yi FanChengqian LiZongjie MaLian WenAbdul SattarKaile SuPublished in: Australasian Conference on Artificial Intelligence (2016)
Keyphrases
- efficient data structures
- edge weights
- data structure
- directed graph
- total weight
- undirected graph
- labeled graphs
- maximum clique
- attributed graphs
- independent set
- bipartite graph
- hamiltonian cycle
- maximum weight
- minimum weight
- maximum cardinality
- quasi cliques
- search algorithm
- weighted graph
- graph properties
- graph matching
- directed acyclic
- simulated annealing
- high dimensional
- maximum independent set
- sparse data
- genetic algorithm
- graph theoretic
- graph representation
- spanning tree
- vertex set
- memetic algorithm
- global search
- connected subgraphs
- search space
- strongly connected
- stochastic local search
- graph structure
- graph theory
- tabu search
- feature selection