An algorithm for reporting maximal \(c\)-cliques

DOI10.1016/j.tcs.2005.09.038zbMath1086.68098OpenAlexW2071321387MaRDI QIDQ817824

C. Karande, Frédéric Cazals

Publication date: 20 March 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.09.038

zbMATH Keywords

shape matchingmaximal \(c\)-connected cliquesmaximal common induced/edge subgraphsmaximal-cliques

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (7)

Modeling Macromolecular Complexes: A Journey Across Scales ⋮ Efficiently enumerating all maximal cliques with bit-parallelism ⋮ Refined pivot selection for maximal clique enumeration in graphs ⋮ Overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms ⋮ A note on the problem of reporting maximal cliques ⋮ On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms ⋮ An algorithm for reporting maximal \(c\)-cliques

Cites Work

• Unnamed Item
• An algorithm for reporting maximal \(c\)-cliques
• Enumerating all connected maximal common subgraphs in two graphs
• A note on the derivation of maximal common subgraphs of two directed or undirected graphs

This page was built for publication: An algorithm for reporting maximal \(c\)-cliques