Connectivity and minimum cut approximation in the broadcast congested clique

DOI10.1007/978-3-030-01325-7_28OpenAlexW2898811060MaRDI QIDQ1713924

Tomasz Jurdziński, Krzysztof Nowicki

Publication date: 30 January 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-01325-7_28

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx)

Related Items (1)

Fault-tolerant graph realizations in the congested clique

This page was built for publication: Connectivity and minimum cut approximation in the broadcast congested clique