On the tractability of covering a graph with 2-clubs

DOI10.1007/978-3-030-25027-0_17OpenAlexW2966560041MaRDI QIDQ5919357

Riccardo Dondi, Manuel Lafond

Publication date: 30 January 2020

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-25027-0_17

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (7)

On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering ⋮ On the parameterized complexity of s-club cluster deletion problems ⋮ On the parameterized complexity of \(s\)-club cluster deletion problems ⋮ On 2-clubs in graph-based data clustering: theory and algorithm engineering ⋮ On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs ⋮ Even better fixed-parameter algorithms for bicluster editing ⋮ On the tractability of covering a graph with 2-clubs

This page was built for publication: On the tractability of covering a graph with 2-clubs