New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes

Robert Ganian
January 2010
Cite
Type
Conference Paper
Robert Ganian
Robert Ganian

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