"Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs."

Marin Bougeret et al. (2014)

Details and statistics

DOI: 10.1007/978-3-319-04298-5_14

access: closed

type: Conference or Workshop Paper

metadata version: 2022-06-23

a service of  Schloss Dagstuhl - Leibniz Center for Informatics