Worst and Best Case Behaviour of an Approximate Graph Coloring Algorithm

Karl Dürre, Johannes Heuft, Heinrich Müller. Worst and Best Case Behaviour of an Approximate Graph Coloring Algorithm. In Jörg R. Mühlbacher, editor, Proceedings of the 7th Conference Graphtheoretic Concepts in Computer Science (WG '81), Linz, Austria. pages 339-348, Hanser, Munich, 1981.

Abstract

Abstract is missing.