algorithm for d-degenerate graphs.
Austin BuchananJose L. WalterosSergiy ButenkoPanos M. PardalosPublished in: Optim. Lett. (2014)
Keyphrases
- computational complexity
- times faster
- optimization algorithm
- matching algorithm
- np hard
- experimental evaluation
- improved algorithm
- optimal solution
- significant improvement
- cost function
- detection algorithm
- expectation maximization
- objective function
- convergence rate
- clustering method
- segmentation algorithm
- linear programming
- high accuracy
- worst case
- computationally efficient
- computational cost
- search space
- preprocessing
- recognition algorithm
- graph structure
- learning algorithm
- graph model
- graph partitioning
- graph clustering