A note on the problem of reporting maximal cliques
From MaRDI portal
Publication:955035
DOI10.1016/j.tcs.2008.05.010zbMath1153.68038WikidataQ56210397 ScholiaQ56210397MaRDI QIDQ955035
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
68W05: Nonnumerical algorithms
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Unnamed Item, Length-constrained cycle partition with an application to UAV routing*, Sampling-based box-covering algorithm for renormalization of networks, A post-quantum associative memory, Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows, The minimal \(k\)-core problem for modeling \(k\)-assemblies, A graph coloring approach to the deployment scheduling and unit assignment problem, Border bases for lattice ideals, Computing Gröbner bases of pure binomial ideals via submodules of \(\mathbb Z^n\), Finding weighted \(k\)-truss communities in large networks, Computing maximal cliques in link streams, Refined pivot selection for maximal clique enumeration in graphs, Isolation concepts for clique enumeration: comparison and computational experiments, Efficiently enumerating all maximal cliques with bit-parallelism, A new decomposition technique for maximal clique enumeration for sparse graphs, Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs, K-plex cover pooling for graph neural networks, Bayes linear analysis for ordinary differential equations, Fast circular arc segmentation based on approximate circularity and cuboid graph, Facility location with tree topology and radial distance constraints, Structural interpretation of sparse fault data using graph theory and geological rules. Fault data interpretation, A new approximate cluster deletion algorithm for diamond-free graphs, Enumerating all maximal biclusters in numerical datasets, 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, A linear time algorithm for maximal clique enumeration in large sparse graphs, Unfolding the Core Structure of the Reciprocal Graph of a Massive Online Social Network
Uses Software
Cites Work
- Unnamed Item
- An algorithm for reporting maximal \(c\)-cliques
- The worst-case time complexity for generating all maximal cliques and computational experiments
- Enumerating all connected maximal common subgraphs in two graphs
- A New Algorithm for Generating All the Maximal Independent Sets
- Algorithm Theory - SWAT 2004
- The Enumeration of Maximal Cliques of Large Graphs
- Algorithm 457: finding all cliques of an undirected graph
- On cliques in graphs
