Login / Signup
Formulation of path selection by means of maximum flow and minimum delay on a Free Space Optical topology.
Scott Fowler
George Baravdish
Published in:
ICC (2016)
Keyphrases
</>
maximum flow
path selection
minimum cut
shortest path
min cut max flow
directed graph
routing algorithm
push relabel
real time
graph cuts
quality of service
multiscale
low complexity
weighted graph