Cliques of a graph-variations on the Bron-Kerbosch algorithm

DOI10.1007/BF00991836zbMath0401.68042MaRDI QIDQ4185818

H. C. Johnston

Publication date: 1976

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

zbMATH Keywords

AlgorithmCliquesSimple Undirected Graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (11)

Constrained distributed optimization: a population dynamics approach ⋮ Efficiently enumerating all maximal cliques with bit-parallelism ⋮ The worst-case time complexity for generating all maximal cliques and computational experiments ⋮ A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees ⋮ Testing One Hypothesis Multiple Times: The Multidimensional Case ⋮ Theoretical underpinnings for maximal clique enumeration on perturbed graphs ⋮ A graph‐theoretic generalization of the clique concept ⋮ Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms ⋮ Enumerating all connected maximal common subgraphs in two graphs ⋮ The maximum clique problem ⋮ A polynomial algorithm for constructing the clique graph of a line graph

Uses Software

• Algorithm 457

Cites Work

• A versatile system for computer-controlled assembly
• A clique-detection algorithm based on neighborhoods in graphs
• An Analysis of Some Graph Theoretical Cluster Techniques
• The Enumeration of Maximal Cliques of Large Graphs
• Corrections to Bierstone's Algorithm for Generating Cliques
• On a New Approach for Finding All the Modified Cut-Sets in an Incompatibility Graph
• Algorithm 457: finding all cliques of an undirected graph
• On cliques in graphs

This page was built for publication: Cliques of a graph-variations on the Bron-Kerbosch algorithm