An Efficient Algorithm for Enumerating Pseudo Cliques (Q5387774): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-77120-3_36
+Normal rank
@@ Property / OpenAlex ID @@
+W1489695743
@@ Property / OpenAlex ID: W1489695743 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252271
@@ Property / cites work: Q4252271 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234075
@@ Property / cites work: Q4234075 / rank @@
+Normal rank
@@ Property / cites work @@
+Reverse search for enumeration
@@ Property / cites work: Reverse search for enumeration / rank @@
+Normal rank
@@ Property / cites work @@
+The dense \(k\)-subgraph problem
@@ Property / cites work: The dense \(k\)-subgraph problem / rank @@
+Normal rank
@@ Property / cites work @@
+Finding all minimum-cost perfect matchings in Bipartite graphs
+Normal rank
@@ Property / cites work @@
+Algorithm Theory - SWAT 2004
@@ Property / cites work: Algorithm Theory - SWAT 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
+Normal rank
@@ Property / cites work @@
+The worst-case time complexity for generating all maximal cliques and computational experiments
+Normal rank
@@ Property / cites work @@
+Q4370201
@@ Property / cites work: Q4370201 / rank @@
+Normal rank