A note on the problem of reporting maximal cliques (Q955035): Difference between revisions

@@ Property / cites work @@
+The Enumeration of Maximal Cliques of Large Graphs
+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 @@
+Enumerating all connected maximal common subgraphs in two graphs
+Normal rank
@@ Property / cites work @@
+On cliques in graphs
@@ Property / cites work: On cliques in graphs / 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 Algorithm for Generating All the Maximal Independent Sets
+Normal rank
@@ Property / cites work @@
+The worst-case time complexity for generating all maximal cliques and computational experiments
+Normal rank