Tight bounds to localize failure nodes on trees, grids and through embeddings under Boolean network tomography (Q2136288): 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.2022.03.035
+Normal rank
@@ Property / OpenAlex ID @@
+W4221079482
@@ Property / OpenAlex ID: W4221079482 / rank @@
+Normal rank
@@ Property / cites work @@
+Network Tomography of Binary Network Performance Characteristics
+Normal rank
@@ Property / cites work @@
+Q3577833
@@ Property / cites work: Q3577833 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4004146
@@ Property / cites work: Q4004146 / rank @@
+Normal rank
@@ Property / cites work @@
+A Poset Dimension Algorithm
@@ Property / cites work: A Poset Dimension Algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of the Partial Order Dimension Problem
+Normal rank
@@ Property / cites work @@
+The dimension of planar posets
@@ Property / cites work: The dimension of planar posets / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138887
@@ Property / cites work: Q3138887 / rank @@
+Normal rank
@@ Property / cites work @@
+Steiner transitive-closure spanners of low-dimensional posets
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2136288