Search Results for author:
Found 3 papers, 2 papers with code
More Recent Advances in (Hyper)Graph Partitioning
In recent years, significant advances have been made in the design and evaluation of balanced (hyper)graph partitioning algorithms.
Local Motif Clustering via (Hyper)Graph Partitioning
A widely-used operation on graphs is local clustering, i. e., extracting a well-characterized community around a seed node without the need to process the whole graph.
Buffered Streaming Graph Partitioning
On the one hand, there are streaming algorithms that have been adopted to partition massive graph data on small machines.
graph partitioning
Data Structures and Algorithms
