Sign in
A maximum flow algorithm based on storage time aggregated graph for delay-tolerant networks.
Hongyan Li
Tao Zhang
Yangkun Zhang
Kan Wang
Jiandong Li
Published in:
Ad Hoc Networks (2017)
Keyphrases
</>
maximum flow
minimum cut
min cut max flow
graph structure
directed graph
random walk
graph cuts
minimum spanning tree
wireless sensor networks
peer to peer
energy function
social networks
spanning tree
graph partitioning
shortest path problem
k means
delay tolerant
image segmentation