Faster parameterized algorithm for \textsc{Bicluster Editing}

DOI10.1016/j.ipl.2021.106095OpenAlexW3119443352MaRDI QIDQ2656354

Dekel Tsur

Publication date: 11 March 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.07944

zbMATH Keywords

graph algorithmsparameterized complexitybranching algorithms

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

A survey of parameterized algorithms and the complexity of edge modification ⋮ Faster parameterized algorithms for \textsc{Bicluster Editing} and \textsc{Flip Consensus Tree}

Cites Work

• On solving manufacturing cell formation via bicluster editing
• New heuristics for the bicluster editing problem
• Even better fixed-parameter algorithms for bicluster editing
• A parallel hybrid metaheuristic for bicluster editing
• Hybrid Metaheuristic for Bicluster Editing Problem
• Complexity of Dense Bicluster Editing Problems
• Applying Modular Decomposition to Parameterized Bicluster Editing
• Improved Algorithms for Bicluster Editing
• Improved Approximation Algorithms for Bipartite Correlation Clustering
• Fast biclustering by dual parameterization

This page was built for publication: Faster parameterized algorithm for \textsc{Bicluster Editing}