Maximal dynamic polymatroid flows and applicationsHAMACHER, H. W.Discrete applied mathematics. 1986, Vol 15, Num 1, pp 41-54, issn 0166-218XArticle

Flow graphs and decision algorithmsPAWLAK, Zdzisław.Lecture notes in computer science. 2003, pp 1-10, issn 0302-9743, isbn 3-540-14040-9, 10 p.Conference Paper

Polymatroidal flows with lower boundsLAWLER, E. L; MARTEL, C. U.Discrete applied mathematics. 1986, Vol 15, Num 2-3, pp 291-313, issn 0166-218XArticle

Nowhere-zero flows in low genus graphsMOLLER, M; CARSTENS, H. G; BRINKMANN, G et al.Journal of graph theory. 1988, Vol 12, Num 2, pp 183-190, issn 0364-9024Article

An efficient algorithm for the transshipment along a single road problemAGHA IQBAL ALI.Naval research logistics quarterly. 1986, Vol 33, Num 4, pp 673-684, issn 0028-1441Article

Reliability evaluation of flow networks using delta-star transformationsSINGH, C; ASGARPOOR, S.IEEE transactions on reliability. 1986, Vol 35, Num 4, pp 472-477, issn 0018-9529Article

Duality for balanced submodular flowsZIMMERMAN, U.Discrete applied mathematics. 1986, Vol 15, Num 2-3, pp 365-376, issn 0166-218XArticle

Flows in circulant graphs of odd order are sums of Hamilton cyclesLOCKE, S. C; WITTE, D.Discrete mathematics. 1989, Vol 78, Num 1-2, pp 105-114, issn 0012-365X, 10 p.Article

Geometry, Flows, and Graph-Partitioning AlgorithmsARORA, Sanjeev; RAO, Satish; VAZIRANI, Umesh et al.Communications of the ACM. 2008, Vol 51, Num 10, pp 96-105, issn 0001-0782, 10 p.Article

Minimum-delay routing in continuous-time dynamic networks with piecewise-constant capacitiesOGIER, R. G.Networks (New York, NY). 1988, Vol 18, Num 4, pp 303-318, issn 0028-3045Article

A strongly polynomial algorithm for the transportation problemKLEINSCHMIDT, P; SCHANNATH, H.Mathematical programming. 1995, Vol 68, Num 1-2, pp 1-13, issn 0025-5610Article

A capacity-rounding algorithm for the minimum-cost circulation problem: a dual framework of the Tardos algorithmFUJISHIGE, S.Mathematical programming. 1986, Vol 35, Num 3, pp 298-308, issn 0025-5610Article

Families of cuts with the MFMC-propertyKARZANOV, A. V.Combinatorica (Print). 1985, Vol 5, Num 4, pp 325-335, issn 0209-9683Article

A randomized maximum-flow algorithmCHERIYAN, J; HAGERUP, T.SIAM journal on computing (Print). 1995, Vol 24, Num 2, pp 203-226, issn 0097-5397Article

Parallel nested dissection for path algebra computationsPAN, V; REIF, J.Operations research letters. 1986, Vol 5, Num 4, pp 177-184, issn 0167-6377Article

Efficient bytecode verification using immediate postdominators in control flow graphs: Extended abstractBERNARDESCHI, Cinzia; DE FRANCESCO, Nicoletta; MARTINI, Luca et al.Lecture notes in computer science. 2003, pp 425-436, issn 0302-9743, isbn 3-540-20494-6, 12 p.Conference Paper

Flow symmetry and algebraic flowsHARTMANN, M; SCHNEIDER, M. H.ZOR. Zeitschrift für Operations-Research. 1993, Vol 38, Num 3, pp 261-267, issn 0340-9422Article

Group connectivity of graphs. A nonhomogeneous analogue of nowhere-zero flow propertiesJAEGER, F; LINIAL, N; PAYAN, C et al.Journal of combinatorial theory. Series B. 1992, Vol 56, Num 2, pp 165-182, issn 0095-8956Article

Distribution rationnelle des ressources dans les problèmes de flots compte tenu de la fiabilitéVOL'FSON, I. E.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1989, Num 3, pp 169-171, issn 0002-3388Article

Flows on hypermapsCORI, R; MACHI, A.Glasgow mathematical journal. 1988, Vol 30, Num 1, pp 17-29, issn 0017-0895Article

Polymatroidal flow network models with multiple sinksFEDERGRUEN, A; GROENEVELT, H.Networks (New York, NY). 1988, Vol 18, Num 4, pp 285-302, issn 0028-3045Article

Examples of max-flow and min-cut problems with duality gaps in continuous networksNOZAWA, R.Mathematical programming. 1994, Vol 63, Num 2, pp 213-234, issn 0025-5610Article

Tutte's 3-flow conjecture and short cycle coversGENGHUA FAN.Journal of combinatorial theory. Series B. 1993, Vol 57, Num 1, pp 36-43, issn 0095-8956Article

The lattice structure of flow in planar graphsKHULLER, S; NAOR, J; KLEIN, P et al.SIAM journal on discrete mathematics (Print). 1993, Vol 6, Num 3, pp 477-490, issn 0895-4801Article

Determining resistances from boundary measurements in finite networksLAWLER, G. F; SYLVESTER, J.SIAM journal on discrete mathematics. 1989, Vol 2, Num 2, pp 231-239Article