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

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

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

Short cycle covers and the cycle double cover conjectureJAMSHY, U; TARSI, M.Journal of combinatorial theory. Series B. 1992, Vol 56, Num 2, pp 197-204, issn 0095-8956Article

A distributed clustering processCOFFMAN, E. G; COURTOIS, J.-P; GILBERT, E. N et al.Journal of applied probability. 1991, Vol 28, Num 4, pp 737-750, issn 0021-9002Article

A novel signal flow graph based solution for calculation of first and second derivatives of dynamical nonlinear systemsARCANGELI, Andrea; SQUARTINI, Stefano; PIAZZA, Francesco et al.EUSIPCO. Conference. 2004, isbn 3-200-00148-8, 3Vol, volI, 69-72Conference Paper

Performance criteria for graph clustering and Markov cluster experimentsVAN DONGEN, S.Report - Information systems. 2000, Num 12, pp 1-36, issn 1386-3681Article

A parametric maximum flow algorithm for bipartite graphs with applicationsCHEN, Y. L.European journal of operational research. 1995, Vol 80, Num 1, pp 226-235, issn 0377-2217Article

A fast algorithm for maximum integral two-commodity flow in planar graphsKORACH, E; PENN, M.Discrete applied mathematics. 1993, Vol 47, Num 1, pp 77-83, issn 0166-218XArticle

Characterizations of max-balanced flowsROTHBLUM, U. G; SCHNEIDER, H; SCHNEIDER, M. H et al.Discrete applied mathematics. 1992, Vol 39, Num 3, pp 241-261, issn 0166-218XArticle

Modelling high-school education systems in Saudi Arabia using the GERT techniqueALJIFFRY, M. S; AHMAD, S. H; BALILLAH, M. A et al.International journal of systems science. 1990, Vol 21, Num 11, pp 2103-2111, issn 0020-7721Article

Synthèse d'un système optimal de production et de transport avec un graphe acyclique d'un réseau de communications et problèmes connexesBABICH, O. A; PERSHIN, O. YU.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1989, Num 3, pp 156-161, issn 0002-3388Article