Faster parameterized algorithms for Bicluster Editing and Flip Consensus Tree

In the Bicluster Editing (resp., Flip Consensus Tree) problem the input is a bipartite graph G=(V1,V2,E) and an integer k, and the goal is to decide whether there is a set F⊆V1×V2 such that the graph (V1,V2,E△F) does not contain an induced path on four vertices (resp., an induced path on five vertic...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 953; p. 113796
Main Author:	Tsur, Dekel
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 10.04.2023
Subjects:	Branching algorithms Graph algorithms Parameterized complexity Parameterized complexity Branching algorithms Graph algorithms
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!