Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Mulligan et al. (1972) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: