CHARACTERIZATIONS OF REDUCIBLE FLOW GRAPHS.HECHT MS; ULLMAN JD.1974; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1974; VOL. 21; NO 3; PP. 367-375; BIBL. 12 REF.Article

TENSIONS ET SEMITENSIONS SUR UN GRAPHE.ALEMANY R; DIEGO A.1973; UNIV. NACION. TUCUMAN, REV., A; ARGENT.; DA. 1973; VOL. 23; NO 1-2; PP. 221-227; BIBL. 3 REF.Article

A strongly polynomial minimum cost circulation algorithmTARDOS, E.Combinatorica (Print). 1986, Vol 5, Num 3, pp 147-255, issn 0209-9683Article

Tutte's 5-flow conjecture for the projective planeSTEINBERG, R.Journal of graph theory. 1984, Vol 8, Num 2, pp 277-285, issn 0364-9024Article

Preemptive scheduling linear programming and network flowsDE WERRA, D.SIAM journal on algebraic and discrete methods. 1984, Vol 5, Num 1, pp 11-20, issn 0196-5212Article

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

A unified framework for primal-dual methods in minimum cost network flow problemsBERTSEKAS, D. P.Mathematical programming. 1985, Vol 32, Num 2, pp 125-145, issn 0025-5610Article

Problème de flot maximal dans les réseaux avec retransmissionKUZ'MIN, S. L.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1984, Num 3, pp 133-135, issn 0002-3388Article

Integer flowsYOUNGER, D. H.Journal of graph theory. 1983, Vol 7, Num 3, pp 349-357, issn 0364-9024Article

Etude numérique de la convergence des flots redondants réunis vers un flot de PoissonVRAZHNOV, V. N; DUBROVINSKIJ, V. M; SHNEPS, M. A et al.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1983, Num 6, pp 129-135, issn 0002-3388Article

Sur un modèle de développement d'un réseau de communicationsVASIL'EV, N. S.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1985, Num 6, pp 15-21, issn 0002-3388Article

Three commodity flows in graphsOKAMURA, H; IYANAGA, S.Proceedings of the Japan Academy. Series A Mathematical sciences. 1983, Vol 59, Num 6, pp 266-269, issn 0386-2194Article

FINDING THE DEPTH OF A FLOW GRAPH.FONG AC; ULLMAN JD.1977; J. COMPUTERS SYST. SCI.; U.S.A.; DA. 1977; VOL. 15; NO 3; PP. 300-309; BIBL. 9 REF.Article

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 integral flows on a bidirected graphBOUCHET, A.Journal of combinatorial theory. Series B. 1983, Vol 34, Num 3, pp 279-292, issn 0095-8956Article

Un problème de flot avec des contraintes sur le nombre de transitsKUZ'MIN, S. L.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1985, Num 2, pp 77-83, issn 0002-3388Article

On multicommodity flows in planar graphsHASSIN, R.Networks (New York, NY). 1984, Vol 14, Num 2, pp 225-235, issn 0028-3045Article

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

A SHORT PROOF OF THE TWO-COMMODITY FLOW THEOREMSEYMOUR PD.1979; J. COMBINATOR. THEORY, B; USA; DA. 1979; VOL. 26; NO 3; PP. 370-371; BIBL. 3 REF.Article

ON INTERVAL HYPERGRAPHS AND NOWHERE-ZEROFLOWS IN GRAPHS.JAEGER F.1978; MATH. APPL. INFORMAT., RAPP. RECH.; FRA; DA. 1978; NO 126; PP. 1-12; BIBL. 11 REF.Serial Issue

A NOTE ON THE HECHT-ULLMAN CHARACTERIZATION OF NONREDUCIBLE FLOW GRAPHS.ADAMS JM; PHELAN JM; STARK RH et al.1974; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1974; VOL. 3; NO 3; PP. 222-223; BIBL. 1 REF.Article

NOWHERE-ZERO 6-FLOWSSEYMOUR PD.1981; J. COMP. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1981; VOL. 30; NO 2; PP. 130-135; BIBL. 6 REF.Article

BLOCKING PAIRS OF POLYHEDRA ARISING FROM NETWORK FLOWS.FULKERSON DR; WEINBERGER DB.1975; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1975; VOL. 18; NO 3; PP. 265-283; BIBL. 10 REF.Article

A NOTE ON FINDING ALL MAXIMUM CATS IN A GRAPH.NIEMINEN J.1974; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1974; VOL. 10; NO 4; PP. 215-217; ABS. ALLEM. RUSSE; BIBL. 4 REF.Article

MULTICOMMODITY FLOWS IN GRAPHSOKAMURA H.1983; DISCRETE APPLIED MATHEMATICS; ISSN 0166-218X; NLD; DA. 1983; VOL. 6; NO 1; PP. 55-62; BIBL. 3 REF.Article