Better Polynomial Algorithms on Graphs of Bounded Rank-Width

Robert Ganian, Petr Hlin\v{e}n{\'{y}}
January 2009
bib

Abstract

Full Citation:

Robert Ganian, Petr Hlin\ven'y. Better Polynomial Algorithms on Graphs of Bounded Rank-Width. Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravic'i, Czech Republic, June 28-July 2, 2009, Revised Selected Papers, pages 266-277, 2009, Springer.

Type
Conference Paper
Robert Ganian
Robert Ganian

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