On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms
From MaRDI portal
Publication:2062119
DOI10.1016/j.tcs.2021.11.005OpenAlexW3215076828MaRDI QIDQ2062119
Publication date: 22 December 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.11.005
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- An algorithm for reporting maximal \(c\)-cliques
- The worst-case time complexity for generating all maximal cliques and computational experiments
- Refined pivot selection for maximal clique enumeration in graphs
- On generating all maximal independent sets
- The maximum clique problem
- Efficiently enumerating all maximal cliques with bit-parallelism
- A new decomposition technique for maximal clique enumeration for sparse graphs
- An improved upper bound on maximal clique listing via rectangular fast matrix multiplication
- Reverse search for enumeration
- Fast maximal cliques enumeration in sparse graphs
- Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs
- Overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms
- Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
- Arboricity and Subgraph Listing Algorithms
- A New Algorithm for Generating All the Maximal Independent Sets
- Computing and Combinatorics
- Listing All Maximal Cliques in Large Sparse Real-World Graphs
- Algorithm Theory - SWAT 2004
- Algorithm 457: finding all cliques of an undirected graph
- On cliques in graphs
- On the complexity of \(k\)-SAT
This page was built for publication: On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms
