Refined pivot selection for maximal clique enumeration in graphs (Q899307): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2015.11.016
@@ Property / DOI: 10.1016/j.tcs.2015.11.016 / 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.2015.11.016
+Normal rank
@@ Property / OpenAlex ID @@
+W2180361393
@@ Property / OpenAlex ID: W2180361393 / rank @@
+Normal rank
@@ Property / cites work @@
+Clique-detection models in computational biochemistry and genomics
+Normal rank
@@ Property / cites work @@
+Algorithm 457: finding all cliques of an undirected graph
+Normal rank
@@ Property / cites work @@
+Enumerating all connected maximal common subgraphs in two graphs
+Normal rank
@@ Property / cites work @@
+The worst-case time complexity for generating all maximal cliques and computational experiments
+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 @@
+On cliques in graphs
@@ Property / cites work: On cliques in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Mersenne twister
@@ Property / cites work: Mersenne twister / rank @@
+Normal rank
@@ Property / cites work @@
+Q3267900
@@ Property / cites work: Q3267900 / rank @@
+Normal rank
@@ Property / cites work @@
+Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2015.11.016
@@ Property / DOI: 10.1016/J.TCS.2015.11.016 / rank @@
+Normal rank