A polyhedral study of the maximum edge subgraph problem (Q5891092): Difference between revisions

@@ Property / author @@
-Flavia Bonomo-Braberman
@@ Property / author: Flavia Bonomo-Braberman / rank @@
-Normal rank
@@ Property / author @@
+Flavia Bonomo-Braberman
@@ Property / author: Flavia Bonomo-Braberman / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2180803756
@@ Property / OpenAlex ID: W2180803756 / 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 @@
+Complexity of finding dense subgraphs
@@ Property / cites work: Complexity of finding dense subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Different Formulations for Solving the Heaviest<i>K</i>-Subgraph Problem
+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 deterministic approximation algorithm for the densest \(k\)-subgraph problem
+Normal rank