Corrections to Bierstone's Algorithm for Generating Cliques

DOI10.1145/321694.321698MaRDI QIDQ5660481zbMATH OpenOpenAlexFDO

Authors Gordon D. Mulligan, Derek G. 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)

Cited in

(13)

• Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs
• Cliques of a graph-variations on the Bron-Kerbosch algorithm
• The maximum clique problem
• Exact approaches for integrated aircraft fleeting and routing at TunisAir
• Some applications of graph theory to clustering
• A stratificational overlapping cluster scheme
• A new backtracking algorithm for generating the family of maximal independent sets of a graph
• Clique analysis of a tolerance relation
• 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
• Complexity and performance of a graph theory algorithm for cluster analysis†
• A note on the complexity of the chromatic number problem
• Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5660481)