Greedily finding a dense subgraph (Q5054810): Difference between revisions

@@ Property / author @@
-Kazuo Iwama
@@ Property / author: Kazuo Iwama / rank @@
-Normal rank
@@ Property / author @@
-Hisao Tamaki
@@ Property / author: Hisao Tamaki / rank @@
-Normal rank
@@ Property / author @@
+Kazuo Iwama
@@ Property / author: Kazuo Iwama / rank @@
+Normal rank
@@ Property / author @@
+Hisao Tamaki
@@ Property / author: Hisao Tamaki / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-61422-2_127
+Normal rank
@@ Property / OpenAlex ID @@
+W1660722709
@@ Property / OpenAlex ID: W1660722709 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234075
@@ Property / cites work: Q4234075 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4871776
@@ Property / cites work: Q4871776 / rank @@
+Normal rank
@@ Property / cites work @@
+Generating sparse 2—spanners
@@ Property / cites work: Generating sparse 2—spanners / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic construction of deterministic algorithms: approximating packing integer programs
+Normal rank
@@ Property / cites work @@
+Q4037432
@@ Property / cites work: Q4037432 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding dense subgraphs
@@ Property / cites work: Finding dense subgraphs / rank @@
+Normal rank