Better Polynomial Algorithms on Graphs of Bounded Rank-Width

Robert Ganian

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