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

DOI10.1007/978-3-319-04298-5_14zbMath1432.68189OpenAlexW49573773MaRDI QIDQ2938098

Rémi Watrigant, Rodolphe Giroudeau, Marin Bougeret, Nicolas Bousquet

Publication date: 13 January 2015

Published in: SOFSEM 2014: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-04298-5_14

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Density (toughness, etc.) (05C42) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (3)

Linear-Time Generation of Random Chordal Graphs ⋮ Computing densest \(k\)-subgraph with structural parameters ⋮ On solving the densestk-subgraph problem on large graphs

This page was built for publication: Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs