Parallel Algorithm for Enumerating Maximal Cliques in Complex Network (Q3627914): Difference between revisions

@@ 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.1007/978-3-540-88067-7_12
+Normal rank
@@ Property / OpenAlex ID @@
+W2403629185
@@ Property / OpenAlex ID: W2403629185 / rank @@
+Normal rank
@@ Property / cites work @@
+Statistical mechanics of complex networks
@@ Property / cites work: Statistical mechanics of complex networks / 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 @@
+On the complexity of multi-parameterized cluster editing
+Normal rank
@@ Property / cites work @@
+The worst-case time complexity for generating all maximal cliques and computational experiments
+Normal rank
@@ Property / cites work @@
+Algorithm 457: finding all cliques of an undirected graph
+Normal rank
@@ Property / cites work @@
+A New Algorithm for Generating All the Maximal Independent Sets
+Normal rank
@@ Property / cites work @@
+Algorithm Theory - SWAT 2004
@@ Property / cites work: Algorithm Theory - SWAT 2004 / rank @@
+Normal rank