Spectral Embedding of k-Cliques, Graph Partitioning and k-Means

DOI10.1145/2840728.2840751zbMath1334.05109OpenAlexW2295225727MaRDI QIDQ2800578

Ali Kemal Sinop, Pranjal Awasthi, Ravishankar Krishnaswamy, Moses Charikar

Publication date: 15 April 2016

Published in: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2840728.2840751

zbMATH Keywords

clusteringgraph partitioning\(k\)-means

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)

Related Items (2)

Spectral concentration and greedy \(k\)-clustering ⋮ Nonpositive curvature is not coarsely universal

This page was built for publication: Spectral Embedding of k-Cliques, Graph Partitioning and k-Means