Edge connectivity between nodes and node-subsets.
Hiro ItoMitsuo YokoyamaPublished in: Networks (1998)
Keyphrases
- undirected graph
- strongly connected
- disjoint paths
- directed graph
- connected components
- graph structure
- edge weights
- root node
- intermediate nodes
- vertex set
- neighboring nodes
- network nodes
- weighted graph
- approximation algorithms
- node selection
- spanning tree
- overlapping communities
- tree nodes
- network connectivity
- node failures
- leaf nodes
- edge detection
- hidden nodes
- source node
- topology control
- destination node
- complex networks
- shortest distance
- random walk
- nodes of a graph
- social networks
- malicious nodes
- spatial coordinates
- bayesian networks
- small world networks
- directed acyclic graph
- shortest path
- parent child
- centrality measures
- random graphs
- black hole
- residual energy
- mobile nodes
- edge information
- minimum cost
- sensor nodes
- wireless sensor networks