A faster algorithm for maximum independent set on interval filament graphs.
Darcy BestMax WardPublished in: J. Graph Algorithms Appl. (2022)
Keyphrases
- learning algorithm
- objective function
- preprocessing
- computational cost
- dynamic programming
- graph structure
- worst case
- minimum spanning tree
- optimal solution
- np hard
- cost function
- computational complexity
- optimization algorithm
- clustering method
- graph theory
- matching algorithm
- maximum independent set
- memory efficient
- bipartite graph
- combinatorial optimization
- tree structure
- social network analysis
- probabilistic model
- k means
- similarity measure