Login / Signup
Improved compact formulations for a wide class of graph partitioning problems in sparse graphs.
Dang Phuong Nguyen
Michel Minoux
Viet Hung Nguyen
Thanh Hai Nguyen
Renaud Sirdey
Published in:
Discret. Optim. (2017)
Keyphrases
</>
graph partitioning
wide class
partitioning algorithm
weighted graph
graph model
max cut
adjacency matrix
spectral graph
image segmentation
pattern recognition
np complete
spectral clustering
language model
object detection
data analysis
min cut
clustering algorithm