Corrections to Bierstone's Algorithm for Generating Cliques
Gordon D. Mulligan, Derek Gordon Corneil · Journal of the ACM · 1972
Recently Augustson and Minker presented a version of the Bierstone algorithm for finding the set of cliques of a finite undirected linear graph.Their version contains two errors.In this paper the counterexamples to their version and the modified version of the Bierstone algorithm are presented.