Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs (Q479213): Difference between revisions

@@ Property / cites work @@
+Graph Partitioning and Graph Clustering
@@ Property / cites work: Graph Partitioning and Graph Clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Number of cliques in random scale-free network ensembles
+Normal rank
@@ Property / cites work @@
+Q3145799
@@ Property / cites work: Q3145799 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast algorithms for max independent set
@@ Property / cites work: Fast algorithms for max independent set / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm 457: finding all cliques of an undirected graph
+Normal rank
@@ Property / cites work @@
+Q5747946
@@ Property / cites work: Q5747946 / rank @@
+Normal rank
@@ Property / cites work @@
+Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
+Normal rank
@@ Property / cites work @@
+<i>k</i>-Degenerate Graphs
@@ Property / cites work: <i>k</i>-Degenerate Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Smallest-last ordering and clustering and graph coloring algorithms
+Normal rank