Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("FLOT GRAPHE")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 722

  • Page / 29

Export

Selection :

  • and

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

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

FOUR-TERMINUS FLOWSSEYMOUR PD.1980; NETWORKS; USA; DA. 1980; VOL. 10; NO 1; PP. 79-86; BIBL. 7 REF.Article

OPTIMAL K-SUCRE GRAPHSGUNTHER G; HARTNELL BL.1980; DISCRETE APPL. MATH.; NLD; DA. 1980; VOL. 2; NO 3; PP. 225-231; BIBL. 5 REF.Article

MULTITERMINAL NETWORK FLOW AND CONNECTIVITY IN UNSYMMETRICAL NETWORKS.SCHNORR CP.1978; LECTURE NOTES COMPUTER SCI.; GERM.; DA. 1978; NO 62; PP. 425-439; BIBL. 8 REF.; (AUTOM. LANG. PROGRAM. COLLOQ. 5; UDINE; 1978)Conference Paper

LA CIRCULATION DANS LES GRAPHES TRACES ARBITRAIREMENT GENERALISESGHIUS V.1977; BUL. INST. POLITEH. "GHEORGHE GHEORGHIU-DEJ" BUCURESTI, CHIM. METALLURG.; ROMAN.; DA. 1977; VOL. 23; NO 1-2; PP. 69-73; ABS. FR.; BIBL. 3 REF.Article

FORMULATION DE QUELQUES PROBLEMES DE GESTION DES STOCKS A L'AIDE, DE LA THEORIE DES FLOTS SUR UN GRAPHE.MAURRAS JF.1975; ELECTR. FR., BULL. DIRECT. ET. RECH.; FR.; DA. 1975; NO 1; PP. 33-40; ABS. ANGL.; BIBL. 4 REF.Article

AGREGATION DES RESEAUX AVEC FLOTS POUR LE CALCUL DE LEUR CAPACITEANTROPOV MV; OVECHKIS YU N; SHENBROT IM et al.1975; IZVEST. AKAD. NAUK S.S.S.R., TEKH. KIBERN.; S.S.S.R.; DA. 1975; NO 2; PP. 50-58; BIBL. 9 REF.Article

FLUX QUI SATISFONT LES ENTREES ET LES SORTIES DANS LES RESEAUX DE TRANSPORTMITITELU S.1972; STUD. CERC. CALC. ECON. CIBERN. ECON.; ROMAN.; DA. 1972; NO 4; PP. 23-32; BIBL. 6 REF.Serial Issue

QUELQUES CONDITIONS SUFFISANTES D'EXISTENCE DE FLOTS NON HOMOGENES DANS LES RESEAUXKRASNENKER AS; KUCHMENT PA.1972; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1972; NO 4; PP. 136-138; BIBL. 4 REF.Serial Issue

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

  • Page / 29