Login / Signup
Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree.
Ahmed El Alaoui
Andrea Montanari
Mark Sellke
Published in:
Random Struct. Algorithms (2023)
Keyphrases
</>
orders of magnitude
times faster
graph theory
data structure
computationally efficient
theoretical analysis
graph structures
data mining
learning algorithm
data streams
benchmark datasets
planar graphs