Experiments with polynomial-time CLIQUE approximation algorithms on very large graphs

Steven Homer, Marcus Peinado. Experiments with polynomial-time CLIQUE approximation algorithms on very large graphs. In David S. Johnson, Michael A. Trick, editors, Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993. Volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 147-168, DIMACS/AMS, 1993.

Abstract

Abstract is missing.