Fast maximal cliques enumeration in sparse graphs (Q1949748): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-012-9632-8
@@ Property / DOI: 10.1007/s00453-012-9632-8 / 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.1007/s00453-012-9632-8
+Normal rank
@@ Property / OpenAlex ID @@
+W1983365058
@@ Property / OpenAlex ID: W1983365058 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm 457: finding all cliques of an undirected graph
+Normal rank
@@ Property / cites work @@
+Arboricity and Subgraph Listing Algorithms
@@ Property / cites work: Arboricity and Subgraph Listing Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
+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 @@
+Cluster-C, an algorithm for the large-scale clustering of protein sequences based on the extraction of maximal cliques
+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 @@
+.1007/S00453-012-9632-8
@@ Property / DOI: 10.1007/S00453-012-9632-8 / rank @@
+Normal rank