A Fast Parallel Algorithm for Computing all Maximal Cliques in a Graph and the Related Problems (Extended Abstract)

Elias Dahlhaus, Marek Karpinski. A Fast Parallel Algorithm for Computing all Maximal Cliques in a Graph and the Related Problems (Extended Abstract). In Rolf G. Karlsson, Andrzej Lingas, editors, SWAT 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad, Sweden, July 5-8, 1988, Proceedings. Volume 318 of Lecture Notes in Computer Science, pages 139-144, Springer, 1988.

Abstract

Abstract is missing.