A faster algorithm for computing the girth of planar and bounded genus graphs.
Hristo N. DjidjevPublished in: ACM Trans. Algorithms (2010)
Keyphrases
- preprocessing
- k means
- computational cost
- times faster
- detection algorithm
- significant improvement
- cost function
- expectation maximization
- learning algorithm
- objective function
- optimal solution
- adjacency graph
- neural network
- recognition algorithm
- optimization algorithm
- segmentation algorithm
- worst case
- dynamic programming
- search space
- high accuracy
- experimental evaluation
- np hard
- computational complexity
- search algorithm
- graph structure
- highly efficient
- undirected graph
- planar graphs
- image segmentation