An algorithm with improved delay for enumerating connected induced subgraphs of a large cardinality.
Shanshan WangChenglong XiaoEmmanuel CasseauPublished in: CoRR (2021)
Keyphrases
- improved algorithm
- k means
- times faster
- learning algorithm
- experimental evaluation
- optimization algorithm
- cost function
- expectation maximization
- computationally efficient
- segmentation algorithm
- preprocessing
- detection algorithm
- matching algorithm
- dynamic programming
- optimal solution
- similarity measure
- path planning
- recognition algorithm
- computational cost
- simulated annealing
- worst case
- np hard
- evolutionary algorithm
- search space
- social networks
- clustering method
- tree structure
- computational complexity
- image sequences
- convex hull
- decision trees