The Enumeration of Maximal Cliques of Large Graphs
From MaRDI portal
Cited in
(24)- 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
- The minimal k-core problem for modeling k-assemblies
- Computing Banzhaf-Coleman and Shapley-Shubik power indices with incompatible players
- Cliques of a graph-variations on the Bron-Kerbosch algorithm
- Listing Maximal Subgraphs Satisfying Strongly Accessible Properties
- Unranking of small combinations from large sets
- Enumerating Minimal Dominating Sets in Triangle-Free Graphs
- On maximal cliques with connectivity constraints in directed graphs
- Finding quasi core with simulated stacked neural networks
- A bisection method for solving distance-based clustering problems globally
- A study of different preemption types to facilitate the recovery of personnel task schedules
- 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
This page was built for publication: The Enumeration of Maximal Cliques of Large Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5650710)
