Cliques of a graph-variations on the Bron-Kerbosch algorithm (Q4185818): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 457 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Enumeration of Maximal Cliques of Large Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A versatile system for computer-controlled assembly / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Some Graph Theoretical Cluster Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 457: finding all cliques of an undirected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a New Approach for Finding All the Modified Cut-Sets in an Incompatibility Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrections to Bierstone's Algorithm for Generating Cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A clique-detection algorithm based on neighborhoods in graphs / rank
 
Normal rank

Latest revision as of 00:38, 13 June 2024

scientific article; zbMATH DE number 3622961
Language Label Description Also known as
English
Cliques of a graph-variations on the Bron-Kerbosch algorithm
scientific article; zbMATH DE number 3622961

    Statements

    Identifiers