Polynomial algorithm for finding the largest independent sets in graphs without forks.
Vladimir E. AlekseevPublished in: Discret. Appl. Math. (2004)
Keyphrases
- learning algorithm
- computational cost
- experimental evaluation
- times faster
- preprocessing
- computational complexity
- cost function
- similarity measure
- search space
- undirected graph
- theoretical analysis
- dynamic programming
- particle swarm optimization
- high accuracy
- objective function
- optimization algorithm
- worst case
- probabilistic model
- np hard
- significant improvement
- k means
- polynomially bounded
- minimum spanning tree
- convergence rate
- maximum common subgraph
- complex networks
- detection algorithm
- expectation maximization
- image segmentation
- feature selection