Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("GRAPH FLOW")

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 638

  • Page / 26

Export

Selection :

  • and

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

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

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

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

MAXIMUM FLOW IN PLANAR NETWORKSKUCERA L.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 418-422; BIBL. 7 REF.Conference Paper

SUBSTITUTES AND COMPLEMENTS IN NETWORK FLOW PROBLEMSGALE D; POLITOF T.1981; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1981; VOL. 3; NO 3; PP. 175-186; BIBL. 3 REF.Article

FLOWS ON GRAPHS APPLIED TO DIAGONAL SIMILARITY AND DIAGONAL EQUIVALENCE FOR MATRICESSAUNDERS BD; SCHNEIDER H.1978; DISCRETE MATH.; NLD; DA. 1978; VOL. 24; NO 2; PP. 205-220; BIBL. 13 REF.Article

OPTIMAL (S,T)-CUTSHAMACHER H.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 100; PP. 383-387; BIBL. 5 REF.Conference Paper

SUR LES FLOTS DYNAMIQUESCIUREA E.1979; AN. STIINT. UNIV. "AL. I. CUZA" IASI, SECT. 1A; ISSN 0041-9109; ROM; DA. 1979; VOL. 25; SUPPL.; PP. 73-77; BIBL. 2 REF.Article

A THEOREM ON FLOW IN DIRECTED GRAPHSARTZNER P; RADO R.1979; J. LONDON MATH. SOC.; GBR; DA. 1979; VOL. 19; NO 1; PP. 187-191; BIBL. 2 REF.Article

GENERALIZATIONS OF HOFFMAN'S EXISTENCE THEOREM FOR CIRCULATIONSHASSIN R.1981; NETWORKS; ISSN 0028-3045; USA; DA. 1981; VOL. 11; NO 3; PP. 243-254; BIBL. 15 REF.Article

CIRCULATIE IN GRAFURI EVANTAI INCHISEGHIUS V.1980; BUL. INST. POLITEH. IASI SECT. 1; ISSN 0304-5188; ROM; DA. 1980; VOL. 26; NO 1-2; PP. 69-73; ABS. FRE; BIBL. 4 REF.Article

MAXIMUM FLOW IN PLANAR NETWORKSITAI A; SHILOACH Y.1979; S.I.A.M. J. COMPUTG; USA; DA. 1979; VOL. 8; NO 2; PP. 135-150; BIBL. 11 REF.Article

A STUDY OF FLOWS IN QUEUEING NETWORKS AND AN APPROXIMATE METHOD FOR SOLUTIONPUJOLLE G; SOULA C.1979; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FRA; DA. 1979; NO 340; 14 P.; ABS. FRE; BIBL. 28 REF.Serial Issue

APPLICATIONS OF THE SEMIFLOW NOTION TO THE BOUNDEDNESS AND LIVENESS PROBLEMS IN THE PETRI NETS THEORYMEMMI G.1978; CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS. 12/1978-03-29/BALTIMORE; USA; BALTIMORE: JOHNS HOPKINS UNIVERSITY; DA. 1978; PP. 505-509; BIBL. 13 REF.Conference Paper

A BOOLEAN THEORY OF NETWORK FLOWS AND METRICS AND ITS APPLICATIONS TO PARTICLE TRANSMISSION AND CLUSTERINGONAGA K; MAYEDA W.1979; NETWORKS; USA; DA. 1979; VOL. 9; NO 3; PP. 249-281; BIBL. 22 REF.Article

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

  • Page / 26