An efficient algorithm for testing goal-minimality of graphs.
Stefan GyürkiJán MazákPublished in: Discret. Appl. Math. (2013)
Keyphrases
- computationally efficient
- detection algorithm
- worst case
- times faster
- preprocessing
- search space
- significant improvement
- cost function
- dynamic programming
- experimental evaluation
- computational cost
- optimization algorithm
- theoretical analysis
- linear programming
- np hard
- graph clustering
- learning algorithm
- recognition algorithm
- test cases
- random graphs
- neural network
- hyper graph
- segmentation algorithm
- expectation maximization
- input data
- high accuracy
- computational complexity
- objective function
- image segmentation
- social networks