Tight Bounds for Maximal Identifiability of Failure Nodes in Boolean Network Tomography.
Nicola GalesiFariba RanjbarPublished in: CoRR (2017)
Keyphrases
- tight bounds
- network structure
- upper bound
- link failure
- network nodes
- real world networks
- hidden nodes
- centrality measures
- sparsely connected
- overlapping communities
- wireless ad hoc networks
- fully connected
- path length
- mobile nodes
- complex networks
- boolean networks
- wireless sensor networks
- network connectivity
- information networks
- neighboring nodes
- cohesive subgroups
- network topologies
- small world
- network model
- network traffic
- image reconstruction
- peer to peer
- network resources
- tomographic reconstruction
- spanning tree
- wireless mesh networks
- boolean functions
- real valued
- community structure
- computer networks
- shortest path
- neural network