On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms (Q2062119): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2021.11.005
@@ Property / DOI: 10.1016/j.tcs.2021.11.005 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2021.11.005
+Normal rank
@@ Property / OpenAlex ID @@
+W3215076828
@@ Property / OpenAlex ID: W3215076828 / rank @@
+Normal rank
@@ Property / cites work @@
+Reverse search for enumeration
@@ Property / cites work: Reverse search for enumeration / rank @@
+Normal rank
@@ Property / cites work @@
+Q3145799
@@ Property / cites work: Q3145799 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm 457: finding all cliques of an undirected graph
+Normal rank
@@ Property / cites work @@
+An algorithm for reporting maximal \(c\)-cliques
@@ Property / cites work: An algorithm for reporting maximal \(c\)-cliques / rank @@
+Normal rank
@@ Property / cites work @@
+Fast maximal cliques enumeration in sparse graphs
@@ Property / cites work: Fast maximal cliques enumeration in sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Arboricity and Subgraph Listing Algorithms
@@ Property / cites work: Arboricity and Subgraph Listing Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+An improved upper bound on maximal clique listing via rectangular fast matrix multiplication
+Normal rank
@@ Property / cites work @@
+Q4598291
@@ Property / cites work: Q4598291 / rank @@
+Normal rank
@@ Property / cites work @@
+Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs
+Normal rank
@@ Property / cites work @@
+Overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms
+Normal rank
@@ Property / cites work @@
+Listing All Maximal Cliques in Large Sparse Real-World Graphs
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+On generating all maximal independent sets
@@ Property / cites work: On generating all maximal independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm Theory - SWAT 2004
@@ Property / cites work: Algorithm Theory - SWAT 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+A new decomposition technique for maximal clique enumeration for sparse graphs
+Normal rank
@@ Property / cites work @@
+On cliques in graphs
@@ Property / cites work: On cliques in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Refined pivot selection for maximal clique enumeration in graphs
+Normal rank
@@ Property / cites work @@
+The maximum clique problem
@@ Property / cites work: The maximum clique problem / rank @@
+Normal rank
@@ Property / cites work @@
+Efficiently enumerating all maximal cliques with bit-parallelism
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
+Normal rank
@@ Property / cites work @@
+Computing and Combinatorics
@@ Property / cites work: Computing and Combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+The worst-case time complexity for generating all maximal cliques and computational experiments
+Normal rank
@@ Property / cites work @@
+A New Algorithm for Generating All the Maximal Independent Sets
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2021.11.005
@@ Property / DOI: 10.1016/J.TCS.2021.11.005 / rank @@
+Normal rank