Finding and certifying a large hidden clique in a semirandom graph (Q4948021): Difference between revisions

@@ label / en / label / en @@
+Finding and certifying a large hidden clique in a semirandom graph
@@ Property / author @@
-Q172552
@@ Property / author: Q172552 / rank @@
-Normal rank
@@ Property / author @@
+Uriel Feige
@@ Property / author: Uriel Feige / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization.
+Normal rank
@@ Property / cites work @@
+Matrix Analysis
@@ Property / cites work: Matrix Analysis / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/(sici)1098-2418(200003)16:2<195::aid-rsa5>3.0.co;2-a
+Normal rank
@@ Property / OpenAlex ID @@
+W2078758709
@@ Property / OpenAlex ID: W2078758709 / rank @@
+Normal rank
@@ Property / title @@
+Finding and certifying a large hidden clique in a semirandom graph (English)
+Normal rank
@@ Property / Wikidata QID @@
+Q56210408
@@ Property / Wikidata QID: Q56210408 / rank @@
+Normal rank