Complexity of finding dense subgraphs (Q1613384): Difference between revisions

@@ Property / cites work @@
+Q4004078
@@ Property / cites work: Q4004078 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234075
@@ Property / cites work: Q4234075 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5687264
@@ Property / cites work: Q5687264 / rank @@
+Normal rank
@@ Property / cites work @@
+Greedily Finding a Dense Subgraph
@@ Property / cites work: Greedily Finding a Dense Subgraph / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum dispersion problem in dense graphs
@@ Property / cites work: Maximum dispersion problem in dense graphs / 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 @@
+A Fast Parametric Maximum Flow Algorithm and Applications
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for maximum dispersion
@@ Property / cites work: Approximation algorithms for maximum dispersion / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4130999
@@ Property / cites work: Q4130999 / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristic and Special Case Algorithms for Dispersion Problems
+Normal rank