Optimizing streaming graph partitioning via a heuristic greedy method and caching strategy

DOI10.1080/10556788.2018.1553971zbMath1461.05168OpenAlexW2914678061MaRDI QIDQ5858999

No author found.

Publication date: 15 April 2021

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2018.1553971

zbMATH Keywords

parallel computingcommunity detectioncomplex networkscache structurestreaming graph partitioning

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory to circuits and networks (94C15) Approximation algorithms (68W25)

Uses Software

• JOSTLE
• Scotch
• GraphLab
• Pregel
• Spark

Cites Work

• A Polylogarithmic Approximation of the Minimum Bisection
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

This page was built for publication: Optimizing streaming graph partitioning via a heuristic greedy method and caching strategy