Algorithm 457: finding all cliques of an undirected graph
From MaRDI portal
Publication:5677064
DOI10.1145/362342.362367zbMath0261.68018OpenAlexW2116007667WikidataQ56210395 ScholiaQ56210395MaRDI QIDQ5677064
Publication date: 1973
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/362342.362367
Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items
Complexity and performance of a graph theory algorithm for cluster analysis†, 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, Parallel Maximum Clique Algorithms with Applications to Network Analysis, A linear time algorithm for maximal clique enumeration in large sparse graphs, Multilevel approaches for large-scale proteomic networks, All roads lead to Rome -- new search methods for the optimal triangulation problem, On finding and enumerating maximal and maximum \( k\)-partite cliques in \( k\)-partite graphs, On CLIQUE Problem for Sparse Graphs of Large Dimension, Efficient bounds on a branch and bound algorithm for graph colouration, A global optimization approach for solving the maximum clique problem, The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints, An algorithm for finding a maximum weighted independent set in an arbitrary graph, 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, Persistent topological features of dynamical systems, MIP formulations for induced graph optimization problems: a tutorial, Detecting negative eigenvalues of exact and approximate Hessian matrices in optimization, An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem, Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem, Exact Solution Algorithms for the Chordless Cycle Problem, Solving larger maximum clique problems using parallel quantum annealing, Computing Solution Space Properties of Combinatorial Optimization Problems Via Generic Tensor Networks, Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows, Extended formulations for perfect domination problems and their algorithmic implications, Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks, Enumerating Independent Linear Inferences, Exact and metaheuristic methods for a real-world examination timetabling problem, Discovering the hidden community structure of public transportation networks, Unnamed Item, Detecting capital market convergence clubs, On the Approximability of the Minimum Weight $t$-partite Clique Problem, An efficient algorithm for maximum entropy extension of block-circulant covariance matrices, Testing One Hypothesis Multiple Times: The Multidimensional Case, Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications, Improvements to MCS algorithm for the maximum clique problem, Noise-Robust Modes of the Retinal Population Code Have the Geometry of “Ridges” and Correspond to Neuronal Communities, Standardization of the input data in classification problems using the descent vector method, Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem, Listing Maximal Subgraphs Satisfying Strongly Accessible Properties, A GENETIC ALGORITHM FOR DETECTING COMMUNITIES IN LARGE-SCALE COMPLEX NETWORKS, Listing Maximal Independent Sets with Minimal Space and Bounded Delay, K-plex cover pooling for graph neural networks, Bayes linear analysis for ordinary differential equations, DEUM - Distribution Estimation Using Markov Networks, MN-EDA and the Use of Clique-Based Factorisations in EDAs, Speeding up branch and bound algorithms for solving the maximum clique problem, Fast circular arc segmentation based on approximate circularity and cuboid graph, A branch and bound algorithm for the maximum clique problem, A tolerance-based heuristic approach for the weighted independent set problem, A note on bimatrix game maximal Selten subsets, On the chromatic numbers of small-dimensional Euclidean spaces, A branch and bound algorithm for the maximum clique problem, Multifidelity Information Fusion Algorithms for High-Dimensional Systems and Massive Data sets, An algorithm for obtaining the chromatic number and an optimal coloring of a graph, Clique-detection models in computational biochemistry and genomics, A fast discovery algorithm for large common connected induced subgraphs, Components in time-varying graphs, Unnamed Item, Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering, 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, Local multiple alignment via subgraph enumeration, Clique analysis of a tolerance relation, 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, Unnamed Item, Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms, Parallel Algorithm for Enumerating Maximal Cliques in Complex Network, Characterizing the complexity of time series networks of dynamical systems: A simplicial approach, A classification for community discovery methods in complex networks, Close-to-optimal algorithm for rectangular decomposition of 3D shapes, Cliques of a graph-variations on the Bron-Kerbosch algorithm, Using Fifth Generation Tools for Solving the Clique Number Problem, Speeding up MCS Algorithm for the Maximum Clique Problem with ILS Heuristic and Other Enhancements, Sampling-based box-covering algorithm for renormalization of networks, Unnamed Item, An enhanced bitstring encoding for exact maximum clique search in sparse graphs, Synthesizing cubes to satisfy a given intersection pattern, Game Theory Explorer: software for the applied game theorist, Lower bounds on paraclique density, An appraisal of the performance of the MMSC subgraph generation algorithm on a Cyber system 170/720, Generating all maximal independent sets on trees in lexicographic order, A multi-KP modeling for the maximum-clique problem, Hierarchical sequencing of online social graphs, An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem, The minimal \(k\)-core problem for modeling \(k\)-assemblies, Integer programming techniques for the nurse rostering problem, Communicability graph and community structures in complex networks, Vertex packing problem application to the design of electronic testing fixtures, Accurate optimization models for interference constrained bandwidth allocation in cellular networks, Computing Banzhaf-Coleman and Shapley-Shubik power indices with incompatible players, Enumeration of Nash equilibria for two-player games, Border bases for lattice ideals, A computational study of conflict graphs and aggressive cut separation in integer programming, 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, Optimal Steiner trees under node and edge privacy conflicts, A variable neighborhood search heuristic for the maximum ratio clique problem, Solving a selective dial-a-ride problem with logic-based Benders decomposition, A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks, Infra-chromatic bound for exact maximum clique search, A new exact maximum clique algorithm for large and massive sparse graphs, Bin packing and related problems: general arc-flow formulation with graph compression, Characteristics and structures of weak efficient surfaces of production possibility sets, The worst-case time complexity for generating all maximal cliques and computational experiments, A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees, What makes a \(\mathbf D_0\) graph Schur positive?, Finding optimal triangulations parameterized by edge clique cover, A novel algorithm for macromolecular epitope matching, Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations, A matheuristic for a customer assignment problem in direct marketing, Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem, Diversification strategies in tabu search algorithms for the maximum clique problem, Characteristics of the maximal independent set ZDD, Clique detection for nondirected graphs: Two new algorithms, Computing maximal cliques in link streams, Refined pivot selection for maximal clique enumeration in graphs, An algorithm for generating all maximal independent subsets of posets, Fast maximal cliques enumeration in sparse graphs, Enumerating maximal cliques in link streams with durations, Efficient Gaussian graphical model determination under \(G\)-Wishart prior distributions, The journey of graph kernels through two decades, A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically, A social communication model based on simplicial complexes, Local community detection in complex networks based on maximum cliques extension, An exact algorithm for the maximum clique problem, Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience, Finding all solutions of affine generalized Nash equilibrium problems with one-dimensional strategy sets, Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs, Overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms, Exact algorithms for maximum clique: a computational study, Heuristics for finding \(k\)-clubs in an undirected graph, Indeterminate strings, prefix arrays \& undirected graphs, \textsc{Rime}: repeat identification, Faster exponential-time algorithms for approximately counting independent sets, Off-line mapping of multi-rate dependent task sets to many-core platforms, A new decomposition technique for maximal clique enumeration for sparse graphs, On detecting maximal quasi antagonistic communities in signed graphs, Maximal strongly connected cliques in directed graphs: algorithms and bounds, A two-level graph partitioning problem arising in mobile wireless communications, 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, A column generation based algorithm for the robust graph coloring problem, A note on the problem of reporting maximal cliques, A parallel maximum clique algorithm for large and massive sparse graphs, Finding quasi core with simulated stacked neural networks, An improved Hara-Takamura procedure by sharing computations on junction tree in Gaussian graphical models, Exact approaches for integrated aircraft fleeting and routing at TunisAir, Theoretical underpinnings for maximal clique enumeration on perturbed graphs, An exact bit-parallel algorithm for the maximum clique problem, New models and algorithms for RNA pseudoknot order assignment, A branch-and-cut algorithm for the pallet loading problem, Detecting community structure via the maximal sub-graphs and belonging degrees in complex networks, Preprocessing and cutting planes with conflict graphs, Subgraph isomorphism, matching relational structures and maximal cliques, An improved upper bound on maximal clique listing via rectangular fast matrix multiplication, Interesting pattern mining in multi-relational data, Speeding up column generation for robust wireless network planning, On identifying dominant cliques., TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph, An algorithm for finding a maximum clique in a graph, 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, Algorithm 457, Integral point sets over \(\mathbb Z_n^m\), An exact algorithm for the pallet loading problem, Construction of all DEA efficient surfaces of the production possibility set under the Generalized Data Development Analysis model, Facets for node packing, Efficient automated pallet loading, Isolation concepts for clique enumeration: comparison and computational experiments, Finding weighted \(k\)-truss communities in large networks, A new backtracking algorithm for generating the family of maximal independent sets of a graph, Enumerating all connected maximal common subgraphs in two graphs, Numerical experiments with LP formulations of the maximum clique problem, An exact algorithm for the maximum \(k\)-club problem in an undirected graph, Finding maximum cliques in arbitrary and in special graphs, The maximum clique problem
