Reconstructing weighted graphs with minimal query complexity (Q2431425): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2010.12.055
+Normal rank
@@ Property / OpenAlex ID @@
+W2148859963
@@ Property / OpenAlex ID: W2148859963 / 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 @@
+Q5302100
@@ Property / cites work: Q5302100 / rank @@
+Normal rank
@@ Property / cites work @@
+On a lemma of Littlewood and Offord
@@ Property / cites work: On a lemma of Littlewood and Offord / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal reconstruction of graphs under the additive model
+Normal rank
@@ Property / cites work @@
+Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
+Normal rank
@@ Property / cites work @@
+Q4218421
@@ Property / cites work: Q4218421 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5839995
@@ Property / cites work: Q5839995 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5417652
@@ Property / cites work: Q5417652 / rank @@
+Normal rank