Time-varying universal maximum flow problems

Mathematical and Computer Modelling

Volumn 33, Issue 4-5, 2001, Pages 407-430

  Cai, X ^a   Sha, D ^a   Wong, C K ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Algorithms; Computational complexity; Network programming; Time varying networks; Universal maximum flow

Indexed keywords

EID: 0035130078     PISSN: 08957177     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0895-7177(00)00252-1     Document Type: Article

References (7)

1. Generalized dynamic flows
2. Transient flows in networks
3. Maximal, lexicographic and dynamic network flows
4. An algorithm for universal maximal dynamic flows in a network
5. Maximum flow through a network