A new algorithm for extracting a small representative subgraph from a very large graph
Harish SethuXiaoyu ChuPublished in: CoRR (2012)
Keyphrases
- np hard
- optimal solution
- detection algorithm
- k means
- dynamic programming
- graph based algorithm
- maximum flow
- probabilistic model
- objective function
- simulated annealing
- preprocessing
- learning algorithm
- search space
- matching algorithm
- graph structure
- cost function
- depth first search
- weighted graph
- maximum matching
- maximum clique
- representative set
- graph construction
- graph model
- graph mining
- directed graph
- clustering method
- expectation maximization
- particle swarm optimization
- evolutionary algorithm
- worst case