A polynomial algorithm for weighted scattering number in interval graphs.
Fengwei LiXiaoyan ZhangHajo BroersmaPublished in: Discret. Appl. Math. (2019)
Keyphrases
- memory requirements
- computational complexity
- dynamic programming
- worst case
- cost function
- learning algorithm
- k means
- times faster
- optimization algorithm
- random graphs
- significant improvement
- segmentation algorithm
- polynomial time complexity
- minimum spanning tree
- detection algorithm
- optimal solution
- computational cost
- graph model
- edge weights
- preprocessing
- similarity measure
- expectation maximization
- scheduling problem
- np hard
- convergence rate
- undirected graph
- maximum weight
- adjacency graph