Fast biclustering by dual parameterization
From MaRDI portal
Publication:5363792
DOI10.4230/LIPIcs.IPEC.2015.402zbMath1378.68072arXiv1507.08158OpenAlexW2963564610MaRDI QIDQ5363792
Somnath Sikdar, Felix Reidl, Fernando Sánchez Villaamil, Pål Grønås Drange
Publication date: 29 September 2017
Full work available at URL: https://arxiv.org/abs/1507.08158
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (8)
Faster parameterized algorithm for \textsc{Bicluster Editing} ⋮ Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule? ⋮ A survey of parameterized algorithms and the complexity of edge modification ⋮ Faster parameterized algorithms for \textsc{Bicluster Editing} and \textsc{Flip Consensus Tree} ⋮ Parameterized low-rank binary matrix approximation ⋮ Even better fixed-parameter algorithms for bicluster editing ⋮ Complexity of modification problems for reciprocal best match graphs ⋮ A simple and improved parameterized algorithm for bicluster editing
This page was built for publication: Fast biclustering by dual parameterization
