Decomposition of sparse graphs into two forests, one having bounded maximum degree - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Information Processing Letters Year : 2010

Dates and versions

lirmm-01263807 , version 1 (28-01-2016)

Identifiers

Cite

Mickaël Montassier, André Raspaud, Xuding Zhu. Decomposition of sparse graphs into two forests, one having bounded maximum degree. Information Processing Letters, 2010, 110 (20), pp.913-916. ⟨10.1016/j.ipl.2010.07.009⟩. ⟨lirmm-01263807⟩
136 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More