Streaming Balanced Graph Partitioning Algorithms for Random Graphs

DOI10.1137/1.9781611973402.95zbMath1422.68326arXiv1212.1121OpenAlexW4251624562MaRDI QIDQ5384057

Isabelle Stanton

Publication date: 20 June 2019

Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1212.1121

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Distributed balanced partitioning via linear embedding

This page was built for publication: Streaming Balanced Graph Partitioning Algorithms for Random Graphs