THE NUMBER OF ROUNDS NEEDED TO EXCHANGE INFORMATION WITHIN A GRAPHASSMANN SF; KLEITMAN DJ.1983; DISCRETE APPLIED MATHEMATICS; ISSN 0166-218X; NLD; DA. 1983; VOL. 6; NO 2; PP. 117-125; BIBL. 10 REF.Article

A SYSTEMATIC APPROACH TO THE EVALUATION OF FLOWGRAPH TRANSMISSION EQUATIONSBHATTACHARYYA B.1972; J. INSTIT. TELECOMMUNIC. ENGRS; INDIA; DA. 1972; VOL. 18; NO 8; PP. 369-373; BIBL. 5 REF.Serial Issue

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

MINIMIZATION ON SUBMODULAR FLOWSZIMMERMANN U.1982; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1982; VOL. 4; NO 4; PP. 303-323; BIBL. 9 REF.Article

THE MAXIMUM K-FLOW IN A NETWORKKOUBEK V; RIHA A.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 389-397; BIBL. 9 REF.Conference Paper

OPTIMAL SPREADING IN AN N DIMENSIONAL RECTILINEAR GRIDPECK GW.1980; STUD. APPL. MATH.; USA; DA. 1980; VOL. 62; NO 1; PP. 69-74; BIBL. 2 REF.Article

A MULTICOMMODITY FLOW PROBLEM.KANT E.1974; NETWORKS; U.S.A.; DA. 1974; VOL. 4; NO 3; PP. 267-280; BIBL. 2 REF.Article

UTILISATION OF THE SIGNAL FLOW GRAPH IN POLARIZATION OPTICAL STUDIESCHAKRABORTY AK.1972; INDIAN J. PURE APPL. PHYS.; INDIA; DA. 1972; VOL. 10; NO 9; PP. 680-682; BIBL. 4 REF.Serial Issue

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

ACCROISSEMENT DE L'EFFICACITE DES ALGORITHMES DE RESOLUTION D'UN PROBLEME DE TRANSPORT SUIVANT LE CRITERE DE TEMPSALEKSEEV AO.1982; IZV. AKAD. NAUK SSSR, TEH. KIBERN.; ISSN 0002-3388; SUN; DA. 1982; NO 1; PP. 34-38; BIBL. 3 REF.Article

A PROGRAM DATA FLOW ANALYSIS PROCEDURE.ALLEN FE; COCKE J.1976; COMMUNIC. A.C.M.; U.S.A.; DA. 1976; VOL. 19; NO 3; PP. 137-147; BIBL. 20 REF.Article

DISJOINT PATHS IN A RECTILINEAR GRIDFRANK A.1982; COMBINATORICA (BUDAPEST. 1981); ISSN 0209-9683; HUN; DA. 1982; VOL. 2; NO 4; PP. 361-371; BIBL. 13 REF.Article

MINIMIZATION OF SOME NONLINEAR FUNCTIONS OVER POLYMATROIDAL NETWORK FLOWSZIMMERMANN U.1982; NORTH-HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1982; NO 66; PP. 287-309; BIBL. 18 REF.Conference Paper

MENGENFLUSSGRAPHEN - EIN WERKZEUG ZUR AUTOMATISCHEN GENERIERUNG VON ENTSCHEIDUNGSMODELLEN = "GRAPHE FLOT QUANTITE" - UN OUTIL POUR LA GENERATION AUTOMATIQUE DE MODELES DE DECISIONCZAP H.1982; ANGEWANDTE INFORMATIK; ISSN 0013-5704; DEU; DA. 1982; NO 12; PP. 600-606; ABS. ENG; BIBL. 10 REF.Article

FLOWS IN QUENING NETWORKS: A MARTINGALE APPROACHWALRAND J; VARAIYA P.1981; MATH. OPER. RES.; ISSN 0364-765X; USA; DA. 1981; VOL. 6; NO 3; PP. 387-404; BIBL. 21 REF.Article

THE SUBGRAPH HOMEOMORPHISM PROBLEM ON REDUCIBLE FLOW GRAPHSHIRATA T; KIMURA M.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; VOL. 108; PP. 65-78; BIBL. 11 REF.Conference Paper

DISTRIBUTION OF THE FLOWS IN A GENERAL JACKSON NETWORKLABETOULLE J; PUJOLLE G; SOULA C et al.1979; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FRA; DA. 1979; NO 341; 33 P.; ABS. FRE; BIBL. 10 REF.Serial Issue

NETWORK FLOW AND TESTING GRAPH CONNECTIVITY.EVEN S; TARJAN RE.1975; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1975; VOL. 4; NO 4; PP. 507-518; BIBL. 11 REF.Article

COMPUTATIONALLY RELATED PROBLEMS.SARTAJ SAHNI.1974; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1974; VOL. 3; NO 4; PP. 262-279; BIBL. 10 REF.Article

AN ALGORITHM FOR NONLINEAR MULTICOMMODITY FLOW PROBLEMS.KLESSIG RW.1974; NETWORKS; U.S.A.; DA. 1974; VOL. 4; NO 4; PP. 343-355; BIBL. 1 P.Article