Graph Edge Partitioning via Neighborhood Heuristic.
Chenzi ZhangFan WeiQin LiuZhihao Gavin TangZhenguo LiPublished in: KDD (2017)
Keyphrases
- weighted graph
- vertex set
- graph partitioning
- undirected graph
- partitioning algorithm
- neighborhood graph
- minimum cut
- minimum spanning tree
- min cut
- edge weights
- graph model
- neighborhood structure
- graph theory
- disjoint paths
- simulated annealing
- depth first search
- dynamic programming
- maximum independent set
- random walk
- directed graph
- minimal spanning tree
- structured data
- spanning tree
- edge detection
- graph representation
- strongly connected
- search algorithm
- graph search
- heuristic function
- graph theoretic
- normalized cut
- edge information
- connected components
- marr hildreth
- multiscale
- combinatorial optimization
- affinity graph
- min sum
- data objects
- feasible solution
- graph matching
- solution quality
- bipartite graph
- graph structure
- greedy heuristic
- directed acyclic graph
- graph construction