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

Abstract

Full Citation:

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

Robert Ganian

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