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

Robert Ganian, Petr Hlinen{\'{y}}
January 2010
bib

Abstract

Full Citation:

Robert Ganian, Petr Hlinen'y. New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes. SOFSEM 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Ml'yn, Czech Republic, January 23-29, 2010. Proceedings, volume 5901 of Lecture Notes in Computer Science, pages 428-439, 2010, Springer.

Type
Conference Paper
Robert Ganian
Robert Ganian

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