A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width

Robert Ganian, Petr Hlinený, Jan Obdrzálek
January 2013
bib

Abstract

Full Citation:

Robert Ganian, Petr Hlinený, Jan Obdrzálek. A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width. Eur. J. Comb., volume 34, number 3, pages 680–701, 2013.

Type
Journal Article
Robert Ganian
Robert Ganian

Robert Ganian is a Professor at the Algorithms and Complexity Group.