A novel parallel local search algorithm for the maximum vertex weight clique problem in large graphs.
Ender SevinçTansel DökerogluPublished in: Soft Comput. (2020)
Keyphrases
- search algorithm
- edge weights
- directed graph
- graph search
- undirected graph
- maximum clique
- independent set
- labeled graphs
- total weight
- attributed graphs
- depth first search
- graph properties
- quasi cliques
- parallel processing
- parallel implementation
- branch and bound
- graph theoretic
- maximum weight
- maximum cardinality
- subgraph isomorphism
- graph mining
- hamiltonian cycle
- bipartite graph
- search space
- search problems
- graph databases
- social network analysis
- random walk