A Parallel Framework for Approximate Max-Dicut in Partitionable Graphs

Nico Bertram, Jonas Ellert, Johannes Fischer 0001. A Parallel Framework for Approximate Max-Dicut in Partitionable Graphs. In Christian Schulz 0003, Bora Uçar, editors, 20th International Symposium on Experimental Algorithms, SEA 2022, July 25-27, 2022, Heidelberg, Germany. Volume 233 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]

Abstract

Abstract is missing.