L. Võhandu, R. Kuusik

Cliques and Algorithms with Hidden Parallelism (pdf)

The problem of hidden parallelism of algorithms based on theory of monotone systems is discussed. A new fast algorithm for separation of all maximal cliques on finite -non-oriented graph is described. An example of algorithm's work is presented.