Efficiently enumerating all maximal cliques with bit-parallelism (Q1651581): Difference between revisions

@@ Property / DOI @@
-.1016/j.cor.2017.12.006
@@ Property / DOI: 10.1016/j.cor.2017.12.006 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W2775591332
@@ Property / OpenAlex ID: W2775591332 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.00202
@@ Property / arXiv ID: 1801.00202 / rank @@
+Normal rank
@@ Property / cites work @@
+An Analysis of Some Graph Theoretical Cluster Techniques
+Normal rank
@@ Property / cites work @@
+Reverse search for enumeration
@@ Property / cites work: Reverse search for enumeration / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm 457: finding all cliques of an undirected graph
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the maximum clique problem
@@ Property / cites work: An exact algorithm for the maximum clique problem / rank @@
+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 @@
+A note on the problem of reporting maximal cliques
+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 @@
+Q4598291
@@ Property / cites work: Q4598291 / rank @@
+Normal rank
@@ Property / cites work @@
+Listing All Maximal Cliques in Large Sparse Real-World Graphs
+Normal rank
@@ Property / cites work @@
+A Sufficient Condition for Backtrack-Free Search
@@ Property / cites work: A Sufficient Condition for Backtrack-Free Search / rank @@
+Normal rank
@@ Property / cites work @@
+Q4714131
@@ Property / cites work: Q4714131 / rank @@
+Normal rank
@@ Property / cites work @@
+Cliques of a graph-variations on the Bron-Kerbosch algorithm
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Enumerating all connected maximal common subgraphs in two graphs
+Normal rank
@@ Property / cites work @@
+<i>k</i>-Degenerate Graphs
@@ Property / cites work: <i>k</i>-Degenerate Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm Theory - SWAT 2004
@@ Property / cites work: Algorithm Theory - SWAT 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Smallest-last ordering and clustering and graph coloring algorithms
+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 @@
+An improved bit parallel exact maximum clique algorithm
+Normal rank
@@ Property / cites work @@
+An exact bit-parallel algorithm for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
+Normal rank
@@ Property / cites work @@
+Q4452109
@@ Property / cites work: Q4452109 / rank @@
+Normal rank
@@ Property / cites work @@
+A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
+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 / cites work @@
+An upper bound for the chromatic number of a graph and its application to timetabling problems
+Normal rank
@@ Property / DOI @@
+.1016/J.COR.2017.12.006
@@ Property / DOI: 10.1016/J.COR.2017.12.006 / rank @@
+Normal rank