An algorithm for reporting maximal c-cliques

DOI10.1016/J.TCS.2005.09.038zbMATH Open1086.68098OpenAlexW2071321387MaRDI QIDQ817824FDOQ817824

Authors: 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

Recommendations

• A note on the problem of reporting maximal cliques
• Exact algorithms for maximum clique: a computational study
• Algorithm Theory - SWAT 2004
• A new algorithm for the maximum clique problem
• An exact algorithm for the maximum clique problem
• Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
• An algorithm for finding a maximum clique in a graph
• A review on algorithms for maximum clique problems
• A fast algorithm for the maximum clique problem

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Enumerating all connected maximal common subgraphs in two graphs
• A note on the derivation of maximal common subgraphs of two directed or undirected graphs
• Title not available (Why is that?)
• An algorithm for reporting maximal \(c\)-cliques

Cited In (8)

• Modeling macromolecular complexes: a journey across scales
• Correction to: ``Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
• A note on the problem of reporting maximal cliques
• Refined pivot selection for maximal clique enumeration in graphs
• On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms
• Overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms
• Efficiently enumerating all maximal cliques with bit-parallelism
• An algorithm for reporting maximal \(c\)-cliques

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

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