An O(nm)-time certifying algorithm for recognizing HHD-free graphs.
Stavros D. NikolopoulosLeonidas PaliosPublished in: Theor. Comput. Sci. (2012)
Keyphrases
- times faster
- objective function
- dynamic programming
- experimental evaluation
- detection algorithm
- np hard
- preprocessing
- optimal solution
- learning algorithm
- significant improvement
- adjacency graph
- computational cost
- probabilistic model
- high accuracy
- theoretical analysis
- weighted graph
- matching algorithm
- hyper graph
- improved algorithm
- ant colony optimization
- bit rate
- search space
- bayesian networks