Almost tight lower bounds for hard cutting problems in embedded graphs - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

Dates and versions

hal-02136928 , version 1 (22-05-2019)

Identifiers

Cite

Vincent Cohen-Addad, Éric Colin de Verdière, Dániel Marx, Arnaud de Mesmay. Almost tight lower bounds for hard cutting problems in embedded graphs. SoCG 2019 - 35th International Symposium on Computational Geometry, Jun 2019, Portland, OR, United States. ⟨hal-02136928⟩
88 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More