A note on the problem of reporting maximal cliques
DOI10.1016/J.TCS.2008.05.010zbMATH Open1153.68038OpenAlexW1974959172WikidataQ56210397 ScholiaQ56210397MaRDI QIDQ955035FDOQ955035
Authors: C. Karande, Frédéric Cazals 
Publication date: 18 November 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.05.010
Recommendations
- Listing all maximal cliques in large sparse real-world graphs
- On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms
- An algorithm for reporting maximal \(c\)-cliques
- Listing all maximal cliques in sparse graphs in near-optimal time
- Enumerating maximal cliques in large sparse graphs
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Algorithm 457: finding all cliques of an undirected graph
- Title not available (Why is that?)
- A New Algorithm for Generating All the Maximal Independent Sets
- On cliques in graphs
- The Enumeration of Maximal Cliques of Large Graphs
- The worst-case time complexity for generating all maximal cliques and computational experiments
- Algorithm Theory - SWAT 2004
- Enumerating all connected maximal common subgraphs in two graphs
- An algorithm for reporting maximal \(c\)-cliques
Cited In (31)
- Facility location with tree topology and radial distance constraints
- Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs
- Sampling-based box-covering algorithm for renormalization of networks
- New anomaly free supergravities in six dimensions
- A linear time algorithm for maximal clique enumeration in large sparse graphs
- A post-quantum associative memory
- Isolation concepts for clique enumeration: comparison and computational experiments
- A graph coloring approach to the deployment scheduling and unit assignment problem
- The minimal \(k\)-core problem for modeling \(k\)-assemblies
- Title not available (Why is that?)
- Structural interpretation of sparse fault data using graph theory and geological rules. Fault data interpretation
- Fast circular arc segmentation based on approximate circularity and cuboid graph
- Bayes linear analysis for ordinary differential equations
- An extended depth-first search algorithm for optimal triangulation of Bayesian networks
- All roads lead to Rome -- new search methods for the optimal triangulation problem
- Unfolding the Core Structure of the Reciprocal Graph of a Massive Online Social Network
- Border bases for lattice ideals
- Title not available (Why is that?)
- Computing maximal cliques in link streams
- Refined pivot selection for maximal clique enumeration in graphs
- An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem
- Finding weighted \(k\)-truss communities in large networks
- Enumerating all maximal biclusters in numerical datasets
- A new approximate cluster deletion algorithm for diamond-free graphs
- Computing Gröbner bases of pure binomial ideals via submodules of \(\mathbb Z^n\)
- Length-constrained cycle partition with an application to UAV routing*
- Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows
- A new decomposition technique for maximal clique enumeration for sparse graphs
- Efficiently enumerating all maximal cliques with bit-parallelism
- An algorithm for reporting maximal \(c\)-cliques
- K-plex cover pooling for graph neural networks
Uses Software
This page was built for publication: A note on the problem of reporting maximal cliques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q955035)
