Corrections to Bierstone's algorithm for generating cliques
GD Mulligan, DG Corneil - Journal of the ACM (JACM), 1972 - dl.acm.org
GD Mulligan, DG Corneil
Journal of the ACM (JACM), 1972•dl.acm.orgRecently 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.
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.
Abstract
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.