Tight bounds to localize failure nodes on trees, grids and through embeddings under boolean network tomography.
Nicola GalesiFariba RanjbarPublished in: Theor. Comput. Sci. (2022)
Keyphrases
- tight bounds
- network structure
- upper bound
- sparsely connected
- neighboring nodes
- hidden nodes
- decision trees
- boolean networks
- labeled trees
- link failure
- centrality measures
- wireless sensor networks
- tree nodes
- network nodes
- information networks
- wireless ad hoc networks
- image reconstruction
- unstructured peer to peer
- component failures
- spanning tree
- network model
- peer to peer
- root node
- node failures
- propagation model
- directed graph
- vector space
- intermediate nodes
- shortest path
- computer networks
- tree edit distance
- network topology
- small world
- network resources