Algorithm 457: finding all cliques of an undirected graph

Cited in

(only showing first 100 items - show all)

Enumerating Independent Linear Inferences
Maximal strongly connected cliques in directed graphs: algorithms and bounds
Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs
Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks
Cliques of a graph-variations on the Bron-Kerbosch algorithm
On maximal cliques with connectivity constraints in directed graphs
Standardization of the input data in classification problems using the descent vector method
Slack matrices, k-products, and 2-level polytopes
Subgraph isomorphism, matching relational structures and maximal cliques
Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience
On identifying dominant cliques.
Lower bounds on paraclique density
Numerical experiments with LP formulations of the maximum clique problem
Sampling-based box-covering algorithm for renormalization of networks
On computing large temporal (unilateral) connected components
The maximum clique problem
Solving larger maximum clique problems using parallel quantum annealing
Characteristics of the maximal independent set ZDD
Efficient Gaussian graphical model determination under G-Wishart prior distributions
Efficient automated pallet loading
A linear time algorithm for maximal clique enumeration in large sparse graphs
A maximal-clique-based set-covering approach to overlapping community detection
An improved Hara-Takamura procedure by sharing computations on junction tree in Gaussian graphical models
Learning to sample initial solution for solving 0-1 discrete optimization problem by local search
New anomaly free supergravities in six dimensions
Exact approaches for integrated aircraft fleeting and routing at TunisAir
Efficient bounds on a branch and bound algorithm for graph colouration
The problem of independent sets in course schedule selection
Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
Solving a selective dial-a-ride problem with logic-based Benders decomposition
On detecting maximal quasi antagonistic communities in signed graphs
Hierarchical sequencing of online social graphs
Isolation concepts for clique enumeration: comparison and computational experiments
Theoretical underpinnings for maximal clique enumeration on perturbed graphs
An improved upper bound on maximal clique listing via rectangular fast matrix multiplication
Stable set reformulations for the degree preserving spanning tree problem
Exact Solution Algorithms for the Chordless Cycle Problem
Defensive alliances in signed networks
The minimal k-core problem for modeling k-assemblies
Integer programming techniques for the nurse rostering problem
Generating all maximal independent sets on trees in lexicographic order
Discovering the hidden community structure of public transportation networks
Computing Solution Space Properties of Combinatorial Optimization Problems Via Generic Tensor Networks
Computation of certain domination numbers of collaboration graphs
Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem
Clique cover on L-EPG representations of graphs
A branch and bound algorithm for the maximum clique problem
Faster exponential-time algorithms for approximately counting independent sets
Representation of zeros of a copositive matrix via maximal cliques of a graph
Synthesizing cubes to satisfy a given intersection pattern
Detecting community structure via the maximal sub-graphs and belonging degrees in complex networks
Listing subgraphs by Cartesian decomposition
A genetic algorithm for detecting communities in large-scale complex networks
Accurate optimization models for interference constrained bandwidth allocation in cellular networks
On CLIQUE Problem for Sparse Graphs of Large Dimension
DEUM -- distribution estimation using Markov networks
Three-way conflict analysis and resolution based on interval set information
Parallel maximum clique algorithms with applications to network analysis
An exact bit-parallel algorithm for the maximum clique problem
A two-level graph partitioning problem arising in mobile wireless communications
Structural interpretation of sparse fault data using graph theory and geological rules. Fault data interpretation
A global optimization approach for solving the maximum clique problem
Large-scale clique cover of real-world networks
A tolerance-based heuristic approach for the weighted independent set problem
Computing Banzhaf-Coleman and Shapley-Shubik power indices with incompatible players
Extended formulations for perfect domination problems and their algorithmic implications
Close-to-optimal algorithm for rectangular decomposition of 3D shapes.
Multifidelity information fusion algorithms for high-dimensional systems and massive data sets
A matheuristic for a customer assignment problem in direct marketing
New models and algorithms for RNA pseudoknot order assignment
On finding and enumerating maximal and maximum \( k\)-partite cliques in \( k\)-partite graphs
A note on the problem of reporting maximal cliques
Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints
A variable neighborhood search heuristic for the maximum ratio clique problem
Complementarity in finite quantum mechanics and computer-aided computations of complementary observables
Computing maximal subsemigroups of a finite semigroup
Community detection in complex networks: from statistical foundations to data science applications
LeaDCD: leadership concept-based method for community detection in social networks
Combinatorial topological models for phylogenetic networks and the mergegram invariant
Preprocessing and cutting planes with conflict graphs
Noise-robust modes of the retinal population code have the geometry of ``ridges and correspond to neuronal communities
Fast circular arc segmentation based on approximate circularity and cuboid graph
Game Theory Explorer: software for the applied game theorist
Finding all solutions of affine generalized Nash equilibrium problems with one-dimensional strategy sets
A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees
Construction of all DEA efficient surfaces of the production possibility set under the Generalized Data Development Analysis model
Testing One Hypothesis Multiple Times: The Multidimensional Case
\({\mathcal{R}}(K_6-e,K_4) =30^\ast\)
MIP formulations for induced graph optimization problems: a tutorial
Detecting negative eigenvalues of exact and approximate Hessian matrices in optimization
An algorithm for finding a maximum weighted independent set in an arbitrary graph
An efficient algorithm for maximum entropy extension of block-circulant covariance matrices
An algorithm for generating all maximal independent subsets of posets
Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
Characterizing the complexity of time series networks of dynamical systems: a simplicial approach
A branch-and-check approach for a wind turbine maintenance scheduling problem
Indeterminate strings, prefix arrays \& undirected graphs
Bayes linear analysis for ordinary differential equations
Speeding up column generation for robust wireless network planning

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)