Tight Bounds for Maximal Identifiability of Failure Nodes in Boolean Network Tomography.
Nicola GalesiFariba RanjbarPublished in: ICDCS (2018)
Keyphrases
- tight bounds
- network structure
- upper bound
- image reconstruction
- hidden nodes
- neighboring nodes
- fully connected
- node failures
- information networks
- network topologies
- real world networks
- complex networks
- link failure
- network nodes
- network connectivity
- unstructured peer to peer
- cohesive subgroups
- peer to peer
- boolean networks
- shortest path
- origin destination
- centrality measures
- network traffic
- scale free
- computer networks
- path length
- neural network
- directed graph
- social network analysis
- strongly connected
- intermediate nodes
- overlapping communities
- small world
- causal models
- sparsely connected
- component failures
- network model
- community structure