Local approximation of the Maximum Cut in regular graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2020

Local approximation of the Maximum Cut in regular graphs

Dates et versions

hal-02816216 , version 1 (06-06-2020)

Identifiants

Citer

Étienne Bamas, Louis Esperet. Local approximation of the Maximum Cut in regular graphs. Theoretical Computer Science, 2020, 820, pp.45-59. ⟨10.1016/j.tcs.2020.03.008⟩. ⟨hal-02816216⟩
47 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More