An efficient algorithm to test forcibly-connectedness of graphical degree sequences.
Kai WangPublished in: CoRR (2018)
Keyphrases
- times faster
- computational cost
- optimization algorithm
- computationally efficient
- learning algorithm
- np hard
- dynamic programming
- high accuracy
- optimal solution
- computational complexity
- preprocessing
- cost function
- experimental evaluation
- selection algorithm
- worst case
- simulated annealing
- segmentation algorithm
- convex hull
- sequence matching
- memory efficient
- classification algorithm
- tree structure
- clustering method
- probabilistic model
- video sequences
- face recognition