OffStreamNG: Partial Stream Hybrid Graph Edge Partitioning Based on Neighborhood Expansion and Greedy Heuristic.
Tewodros AyallHancong DuanChanghong LiuFantahun GeremeMesay DeleliPublished in: ADBIS (Short Papers) (2020)
Keyphrases
- greedy heuristic
- minimum weight
- weighted graph
- vertex set
- graph partitioning
- greedy algorithm
- np hard
- partitioning algorithm
- undirected graph
- neighborhood graph
- disjoint paths
- knapsack problem
- neighborhood structure
- edge weights
- minimum cut
- graph theory
- real time
- edge detection
- affinity graph
- directed graph
- lower bound
- spectral graph
- graph model
- edge information
- data streams
- min cut
- connected components
- random walk
- graph construction
- worst case analysis
- machine learning
- normalized cut
- graph theoretic
- graph mining
- bipartite graph
- approximation algorithms
- graph matching
- edge detector
- sliding window
- computational complexity
- minimum spanning tree
- random graphs
- shortest path
- special case
- multiscale
- image processing
- minimal spanning tree