Approximating the sparsest $k$-subgraph in chordal graph - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Theory of Computing Systems Year : 2016

Dates and versions

lirmm-01383119 , version 1 (18-10-2016)

Identifiers

Cite

Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau. Approximating the sparsest $k$-subgraph in chordal graph. Theory of Computing Systems, 2016, 58 (1), pp.111-132. ⟨10.1007/s00224-014-9568-2⟩. ⟨lirmm-01383119⟩
133 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More