The Enumeration of Maximal Cliques of Large Graphs
From MaRDI portal
Publication:5650710
DOI10.1137/0202001zbMath0239.05125MaRDI QIDQ5650710
Publication date: 1973
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0d44abb0e98946cd42c34304fba64977eb8cebbd
05C30: Enumeration in graph theory
05-04: Software, source code, etc. for problems pertaining to combinatorics
Related Items
Listing Maximal Subgraphs Satisfying Strongly Accessible Properties, Unnamed Item, Enumerating Minimal Dominating Sets in Triangle-Free Graphs, The minimal \(k\)-core problem for modeling \(k\)-assemblies, Computing Banzhaf-Coleman and Shapley-Shubik power indices with incompatible players, Unranking of small combinations from large sets, Finding quasi core with simulated stacked neural networks, A new backtracking algorithm for generating the family of maximal independent sets of a graph, Generalized core maintenance of dynamic bipartite graphs, A note on the problem of reporting maximal cliques, Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties, Theoretical underpinnings for maximal clique enumeration on perturbed graphs, Some observations on the determination of an upper bound for the clique number of a graph, Enumerating all connected maximal common subgraphs in two graphs, Exact algorithms for maximum clique: a computational study, Micro-review synthesis for multi-entity summarization, Maximal strongly connected cliques in directed graphs: algorithms and bounds, Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs, Large-scale clique cover of real-world networks, Local search for diversified top-\(k\) clique search problem, LP-based dual bounds for the maximum quasi-clique problem, Cliques of a graph-variations on the Bron-Kerbosch algorithm
