)-Time Certifying Algorithm for Recognizing HHD-Free Graphs.
Stavros D. NikolopoulosLeonidas PaliosPublished in: FAW (2007)
Keyphrases
- learning algorithm
- detection algorithm
- optimization algorithm
- times faster
- preprocessing
- np hard
- dynamic programming
- similarity measure
- improved algorithm
- worst case
- computational cost
- attributed graphs
- graph structure
- computationally efficient
- high accuracy
- data sets
- cost function
- computational complexity
- neural network
- input data
- k means
- search algorithm
- convergence rate
- objective function
- bayesian networks
- graph partitioning
- minimum spanning tree