Local approximation of the maximum cut in regular graphs

DOI10.1007/978-3-030-30786-8_6OpenAlexW3022408285MaRDI QIDQ5919465

Étienne Bamas, Louis Esperet

Publication date: 24 February 2020

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

maximum cutdistributed approximationlocal algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

This page was built for publication: Local approximation of the maximum cut in regular graphs