德国人那边也发表了不少关于大规模图的graph vertex-cut partitioning。
Arora S, Rao S, Vazirani U (2008) Geometry, flows, and graph- partitioning algorithms. Commun ACM 51(10):96-105S. Arora, S. Rao, and U. Vazirani, "Geometry, flows, and graph- partitioning algorithms," Communications of the ACM, vol. 51, no. 10, pp. 96-105, 2008....
graph partitioning which enables a well principled design of scalable, streaming graph partitioning algorithms that are amenable to distributed implementation. We show that many previously proposed methods are special instances of this framework, we derive a novel one-pass, streaming graph parti...
2016. Recent Advances in Graph Partitioning. Springer International Publishing, Cham, 117–158. [30]Caldwell Andrew E., Kahng Andrew B., and Markov Igor L.. 2000. Improved algorithms for hypergraph bipartitioning. In Proceedings of the Asia and South Pacific Design Automation Conference (ASP-...
2.2 Graph Coarsening Graph partitioning algorithms such as KL [5] and FM [6] are ef- fective for small graphs. For a large graph, a widely adopted ap- proach is to "coarsen" the graph until its size is small enough for KL or FM. The idea is known as multi-level graph partitioning...
Partitioning large graphs is difficult, especially when performed in the limited models of computation afforded to modern large scale computing systems. In this work we introduce restreaming graph partitioning and develop algorithms that scale similarly to streaming partitioning algorithms yet empirically per...
If you need to accelerate graph algorithms in your applications, check out the new GPU-acceleratednvGRAPHlibrary. You can also read more about nvGRAPH in the post “CUDA 8 Features Revealed”. We are considering adding spectral partitioning to nvGRAPH in the future. Please let us know in the ...
The NVIDIA Graph Analytics library (nvGRAPH) comprises of parallel algorithms for high performance analytics on graphs with up to 2 billion edges.nvGRAPHaccelerates analysis of large graphs by making efficient use of the massive parallelism available in NVIDIA Tesla GPUs and makes it possible to build...
I have develp this code for testing out different streaming graph partitioning algorithms, and validate and try out the partioninig quality with visualization. Technology stack Partitioning algorithms are implemented in cpp+11 and visualization is done using Cytoscape.js. Use Apache Kafka for consume...
G. Karypis and V. Kumar. MeTiS: A software package for partitioning unstructured graphs, partitioning meshes, and computing_ll-reducing orderings of sparse matrices, version 4.0. 1998. Google Scholar G. Karypis and V. Kumar. Multilevel algorithms for multi-constraint graph partitioning. Technical ...