Highly Influenced

4 Excerpts

@inproceedings{BuiXuan2008HjoinAA, title={H-join and algorithms on graphs of bounded rankwidth (SODA submission) a}, author={Binh-Minh Bui-Xuan and Jan Arne Telle}, year={2008} }

- Published 2008

Rankwidth is a graph parameter introduced by Oum and Seymour, based on ranks of adjacency matrices over GF(2). We propose an alternative definition of rankwidth, based on the graph-theoretical notion of H -joins, and give fast dynamic programming algorithms to solve optimization problems on graphs of bounded rankwidth. Such algorithms are interesting since graphs of rankwidth at most k encompass large classes of graphs, e.g., all graphs of treewidth k + 1 or branchwidth k or cliquewidth k… CONTINUE READING