A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs.
Arman BoyaciTínaz EkimMordechai ShalomPublished in: Inf. Process. Lett. (2017)
Keyphrases
- maximum cardinality
- dynamic programming
- bipartite graph
- graph isomorphism
- np hard
- learning algorithm
- minimum spanning tree
- average case
- worst case
- spanning tree
- segmentation algorithm
- minimum weight
- space complexity
- probabilistic model
- search space
- optimal solution
- ant colony optimization
- particle swarm optimization
- computational complexity
- objective function