A Faster Algorithm for Maximum Independent Set on Interval Filament Graphs.
Darcy BestMax WardPublished in: CoRR (2021)
Keyphrases
- learning algorithm
- optimal solution
- graph structure
- computational cost
- computational complexity
- k means
- detection algorithm
- dynamic programming
- maximum independent set
- clustering method
- optimization algorithm
- expectation maximization
- worst case
- cost function
- preprocessing
- segmentation algorithm
- np hard
- matching algorithm
- search space
- highly efficient
- graph theoretic
- minimum spanning tree