Algorithm 457: finding all cliques of an undirected graph
From MaRDI portal
Publication:5677064
DOI10.1145/362342.362367zbMath0261.68018WikidataQ56210395 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
68W99: Algorithms in computer science
05-04: Software, source code, etc. for problems pertaining to combinatorics
Related Items
Using Fifth Generation Tools for Solving the Clique Number Problem, Multilevel approaches for large-scale proteomic networks, A branch and bound algorithm for the maximum clique problem, A branch and bound algorithm for the maximum clique problem, Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering, Local multiple alignment via subgraph enumeration, Algorithm 457, An exact bit-parallel algorithm for the maximum clique problem, TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph, A new backtracking algorithm for generating the family of maximal independent sets of a graph, Finding maximum cliques in arbitrary and in special graphs, Communicability graph and community structures in complex networks, Enumeration of Nash equilibria for two-player games, Characteristics and structures of weak efficient surfaces of production possibility sets, The worst-case time complexity for generating all maximal cliques and computational experiments, Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem, An exact algorithm for the maximum clique problem, A note on the problem of reporting maximal cliques, Theoretical underpinnings for maximal clique enumeration on perturbed graphs, 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, A branch-and-cut algorithm for the pallet loading problem, 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, Heuristics for finding \(k\)-clubs in an undirected graph, An algorithm for obtaining the chromatic number and an optimal coloring of a 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, Clique-detection models in computational biochemistry and genomics, An algorithm for finding a maximum weighted independent set in an arbitrary graph, A GENETIC ALGORITHM FOR DETECTING COMMUNITIES IN LARGE-SCALE COMPLEX NETWORKS, Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms, Parallel Algorithm for Enumerating Maximal Cliques in Complex Network, Standardization of the input data in classification problems using the descent vector method, Complexity and performance of a graph theory algorithm for cluster analysis†, Efficient bounds on a branch and bound algorithm for graph colouration, A global optimization approach for solving the maximum clique problem, Clique analysis of a tolerance relation, Cliques of a graph-variations on the Bron-Kerbosch algorithm
