Login / Signup
A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs.
Yaser Rowshan
Ali Taherkhani
Published in:
Discret. Math. (2022)
Keyphrases
</>
graph partitioning
partitioning algorithm
image segmentation
graph model
spectral clustering
weighted graph
clustering algorithm
max cut
spectral graph partitioning
data clustering
spectral graph
data objects
unsupervised learning
feature vectors
pairwise
normalized cut
min cut
bayesian networks