Vertex-connectivity for node failure identification in Boolean network tomography (Q6121431): Difference between revisions

@@ Property / DOI @@
-.1016/j.ipl.2023.106450
@@ Property / DOI: 10.1016/j.ipl.2023.106450 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2023.106450
+Normal rank
@@ Property / OpenAlex ID @@
+W4387514368
@@ Property / OpenAlex ID: W4387514368 / rank @@
+Normal rank
@@ Property / cites work @@
+Network tomography: recent developments
@@ Property / cites work: Network tomography: recent developments / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-Constrained Group Testing
@@ Property / cites work: Graph-Constrained Group Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Q4506360
@@ Property / cites work: Q4506360 / rank @@
+Normal rank
@@ Property / cites work @@
+Tight bounds to localize failure nodes on trees, grids and through embeddings under Boolean network tomography
+Normal rank
@@ Property / cites work @@
+Q5572939
@@ Property / cites work: Q5572939 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4145737
@@ Property / cites work: Q4145737 / rank @@
+Normal rank
@@ Property / cites work @@
+Network Tomography: Estimating Source-Destination Traffic Intensities from Link Data
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2023.106450
@@ Property / DOI: 10.1016/J.IPL.2023.106450 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6121431