AI helps you reading Science

AI generates interpretation videos

AI extracts and analyses the key points of the paper to generate videos automatically


pub
Go Generating

AI Traceability

AI parses the academic lineage of this thesis


Master Reading Tree
Generate MRT

Expander Decomposition and Pruning - Faster, Stronger, and Simpler.

SODA '19: Symposium on Discrete Algorithms San Diego California January, 2019, pp.2616-2635, (2019)

Cited by: 22|Views32
EI

Abstract

We study the problem of graph clustering where the goal is to partition a graph into clusters, i.e. disjoint subsets of vertices, such that each cluster is well connected internally while sparsely connected to the rest of the graph. In particular, we use a natural bicriteria notion motivated by Kannan, Vempala, and Vetta [27] which we ref...More

Code:

Data:

Your rating :
0

 

Tags
Comments
小科