Algorithm 457: finding all cliques of an undirected graph

Cited in

(only showing first 100 items - show all)

Integral point sets over \(\mathbb Z_n^m\)
Isolation concepts for clique enumeration: comparison and computational experiments
An appraisal of the performance of the MMSC subgraph generation algorithm on a Cyber system 170/720
Clique detection for nondirected graphs: Two new algorithms
An algorithm for generating all maximal independent subsets of posets
A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically
Subgraph isomorphism, matching relational structures and maximal cliques
An algorithm for finding a maximum clique in a graph
Construction of all DEA efficient surfaces of the production possibility set under the Generalized Data Development Analysis model
Facets for node packing
The maximum clique problem
Generating all maximal independent sets on trees in lexicographic order
A multi-KP modeling for the maximum-clique problem
Vertex packing problem application to the design of electronic testing fixtures
Enumerating all connected maximal common subgraphs in two graphs
An exact algorithm for the maximum \(k\)-club problem in an undirected graph
Hierarchical sequencing of online social graphs
Accurate optimization models for interference constrained bandwidth allocation in cellular networks
Computing maximal subsemigroups of a finite semigroup
Branch-and-cut for linear programs with overlapping SOS1 constraints
A branch-and-check approach for a wind turbine maintenance scheduling problem
Efficiently enumerating all maximal cliques with bit-parallelism
A variable neighborhood search heuristic for the maximum ratio clique problem
Solving a selective dial-a-ride problem with logic-based Benders decomposition
A novel algorithm for macromolecular epitope matching
Enumerating maximal cliques in link streams with durations
The journey of graph kernels through two decades
Local community detection in complex networks based on maximum cliques extension
Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience
Exact algorithms for maximum clique: a computational study
A new decomposition technique for maximal clique enumeration for sparse graphs
On detecting maximal quasi antagonistic communities in signed graphs
A two-level graph partitioning problem arising in mobile wireless communications
A branch-and-cut algorithm for the pallet loading problem
Detecting community structure via the maximal sub-graphs and belonging degrees in complex networks
An improved upper bound on maximal clique listing via rectangular fast matrix multiplication
On identifying dominant cliques.
An exact algorithm for the pallet loading problem
Efficient automated pallet loading
An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem
A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees
Diversification strategies in tabu search algorithms for the maximum clique problem
Fast maximal cliques enumeration in sparse graphs
Efficient Gaussian graphical model determination under G-Wishart prior distributions
Heuristics for finding \(k\)-clubs in an undirected graph
Maximal strongly connected cliques in directed graphs: algorithms and bounds
Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs
Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling
New models and algorithms for RNA pseudoknot order assignment
Preprocessing and cutting planes with conflict graphs
A new matching algorithm between trees of shapes and its application to brain tumor segmentation
On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms
Numerical experiments with LP formulations of the maximum clique problem
Optimal Steiner trees under node and edge privacy conflicts
Finding optimal triangulations parameterized by edge clique cover
A matheuristic for a customer assignment problem in direct marketing
A social communication model based on simplicial complexes
Overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms
Faster exponential-time algorithms for approximately counting independent sets
K-plex cover pooling for graph neural networks
Bayes linear analysis for ordinary differential equations
Speeding up branch and bound algorithms for solving the maximum clique problem
Fast circular arc segmentation based on approximate circularity and cuboid graph
A tolerance-based heuristic approach for the weighted independent set problem
A note on bimatrix game maximal Selten subsets
An algorithm for obtaining the chromatic number and an optimal coloring of a graph
A fast discovery algorithm for large common connected induced subgraphs
Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem
Structural interpretation of sparse fault data using graph theory and geological rules. Fault data interpretation
Large-scale clique cover of real-world networks
Flow formulations for curriculum-based course timetabling
The degree of parallelism in generalized stochastic network
Local search for diversified top-\(k\) clique search problem
A new approximate cluster deletion algorithm for diamond-free graphs
Enumerating all maximal biclusters in numerical datasets
Synthesizing cubes to satisfy a given intersection pattern
Game Theory Explorer: software for the applied game theorist
Non-existence of (76,30,8,14) strongly regular graph
Solving the maximum clique problem using a tabu search approach
Protein classification by matching and clustering surface graphs
Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
All roads lead to Rome -- new search methods for the optimal triangulation problem
An efficient algorithm for maximum entropy extension of block-circulant covariance matrices
Improvements to MCS algorithm for the maximum clique problem
Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem
Clique-detection models in computational biochemistry and genomics
A linear time algorithm for maximal clique enumeration in large sparse graphs
On finding and enumerating maximal and maximum \( k\)-partite cliques in \( k\)-partite graphs
Lower bounds on paraclique density
New formulations and branch-and-cut procedures for the longest induced path problem
Attribute selection using contranominal scales
A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation
Detecting capital market convergence clubs
Components in time-varying graphs
Speeding up MCS algorithm for the maximum clique problem with ILS heuristic and other enhancements
The minimal k-core problem for modeling k-assemblies
Integer programming techniques for the nurse rostering problem
Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
Computing Banzhaf-Coleman and Shapley-Shubik power indices with incompatible players
An algorithm for finding a maximum weighted independent set in an arbitrary graph

This page was built for publication: Algorithm 457: finding all cliques of an undirected graph

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