Theorem 1 In time O(n2 log n + out) we can determine all maximal cliques in c-max-tolerance graphs.