A Simple Polynomial Time Algorithm for Max Cut on Laminar Geometric Intersection Graphs.
Utkarsh JoshiSaladi RahulJosson Joe ThoppilPublished in: FSTTCS (2022)
Keyphrases
- max cut
- computational complexity
- k means
- np hard
- graph partitioning
- worst case
- objective function
- search space
- randomly generated
- similarity measure
- graph model
- optimization algorithm
- special case
- data clustering
- segmentation algorithm
- spanning tree
- search algorithm
- minimum spanning tree
- spectral graph
- image segmentation