Corrections to Bierstone's Algorithm for Generating Cliques

DOI10.1145/321694.321698zbMath0247.68010OpenAlexW2004639699MaRDI QIDQ5660481

Gordon D. Mulligan, Derek Gordon Corneil

Publication date: 1972

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321694.321698

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Algorithms in computer science (68W99)

Related Items (13)

Complexity and performance of a graph theory algorithm for cluster analysis† ⋮ Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem ⋮ A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically ⋮ Clique optimization: A method to construct parsimonious ultrametric trees from similarity data ⋮ Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs ⋮ Exact approaches for integrated aircraft fleeting and routing at TunisAir ⋮ Some applications of graph theory to clustering ⋮ A note on the complexity of the chromatic number problem ⋮ Clique analysis of a tolerance relation ⋮ Cliques of a graph-variations on the Bron-Kerbosch algorithm ⋮ A new backtracking algorithm for generating the family of maximal independent sets of a graph ⋮ A stratificational overlapping cluster scheme ⋮ The maximum clique problem

This page was built for publication: Corrections to Bierstone's Algorithm for Generating Cliques