One-to-many node-disjoint paths of hyper-star networks.
László LiptákEddie ChengJong-Seok KimSung Won KimPublished in: Discret. Appl. Math. (2012)
Keyphrases
- disjoint paths
- directed graph
- approximation algorithms
- undirected graph
- small world networks
- social networks
- query processing
- shortest path
- neighboring nodes
- network topologies
- star shaped
- overlapping communities
- criminal networks
- network nodes
- scale free
- path length
- directed acyclic graph
- network analysis
- end to end
- random walk
- image segmentation