Approximating the Sparsest $k$-Subgraph in Chordal Graphs - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2014

Approximating the Sparsest $k$-Subgraph in Chordal Graphs

No file

Dates and versions

lirmm-01283611 , version 1 (05-03-2016)

Identifiers

Cite

Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau. Approximating the Sparsest $k$-Subgraph in Chordal Graphs. WAOA: Workshop on Approximation and Online Algorithms, Sep 2013, Sophia Antipolis, France. pp.73-84, ⟨10.1007/978-3-319-08001-7_7⟩. ⟨lirmm-01283611⟩
109 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More