Approximating the Sparsest k-Subgraph in Chordal Graphs
Crossref DOI link: https://doi.org/10.1007/s00224-014-9568-2
Published Online: 2014-09-13
Published Print: 2016-01
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Watrigant, RĂ©mi
Bougeret, Marin
Giroudeau, Rodolphe
Text and Data Mining valid from 2014-09-13