GAP: Generalizable Approximate Graph Partitioning Framework

2 Mar 2019Azade NaziWill HangAnna GoldieSujith RaviAzalia Mirhoseini

Graph partitioning is the problem of dividing the nodes of a graph into balanced partitions while minimizing the edge cut across the partitions. Due to its combinatorial nature, many approximate solutions have been developed, including variants of multi-level methods and spectral clustering... (read more)

PDF Abstract

Results from the Paper


TASK DATASET MODEL METRIC NAME METRIC VALUE GLOBAL RANK RESULT BENCHMARK
graph partitioning custom GAP All min # 1

Methods used in the Paper