Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("COUPE MINIMALE")

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 28

  • Page / 2
Export

Selection :

  • and

MINIMALE PFADE UND MINIMALE SCHNITTE BEI ZUVERLAESSIGKEITSUNTERSUCHUNGEN = CHEMINS MINIMAUX ET COUPES MINIMALES DANS DES ETUDES DE FIABILITESCHNEEWEISS W.1980; RT, REGELUNGSTECH.; ISSN 0340-434X; DEU; DA. 1980; VOL. 28; NO 9; PP. 289-293; ABS. ENG; BIBL. 5 REF.Article

RESIN, A DESKTOP-COMPUTER PROGRAM FOR FINDING CUT SETSMAGEE D; REFSUM A.1981; IEEE TRANS. RELIAB.; ISSN 0018-9529; USA; DA. 1981; VOL. 30; NO 5; PP. 407-410; BIBL. 4 REF.Article

DECOMPOSITION ALGORITHMS FOR LOCATING MINIMAL CUTS IN A NETWORKJARVIS JJ; TUFEKCI S.1982; MATH. PROGRAM.; ISSN 0025-5610; NLD; DA. 1982; VOL. 22; NO 3; PP. 316-331; BIBL. 22 REF.Article

A GENERALIZATION OF MAX FLOW-MIN CUT.HOFFMAN AJ.1974; MATH. PROGRAMMG; NETHERL.; DA. 1974; VOL. 6; NO 3; PP. 352-359; BIBL. 3 REF.Article

Ramsey partitions of integers and fair divisionsMCAVANEY, K; ROBERTSON, J; WEBB, W et al.Combinatorica (Print). 1992, Vol 12, Num 2, pp 193-201, issn 0209-9683Article

A top down approach to fault tree analysis using Binary Decision DiagramsCONTINI, S; DE COLA, G.Journal européen des systèmes automatisés. 1996, Vol 30, Num 8, pp 1115-1130, issn 1269-6935Article

An algorithm for reducing cut sets in fault-tree analysisLIMNIOS, N; ZIANI, R.IEEE transactions on reliability. 1986, Vol 35, Num 5, pp 559-562, issn 0018-9529Article

A method for evaluating all the minimal cuts of a graphJASMON, G. B; FOONG, K. W.IEEE transactions on reliability. 1987, Vol 36, Num 5, pp 539-545, issn 0018-9529Article

ODD MINIMUM CUT-SETS AND B-MATCHINGS = ENSEMBLES DE COUPURE MINIMAUX IMPAIRS ET B-COUPLAGESPADBERG MW; RAO MR.1982; MATH. OPER. RES.; ISSN 0364-765X; USA; DA. 1982; VOL. 7; NO 1; PP. 67-80; BIBL. 18 REF.Article

DECOMPOSITION ALGORITHMS FOR MINIMAL CUT PROBLEMS = ALGORITHMES DE DECOMPOSITION POUR LES PROBLEMES DE COUPURE MINIMALETUFEKCI S.1981; NAV. RES. LOGIST. Q.; ISSN 0028-1441; USA; DA. 1981; VOL. 28; NO 3; PP. 431-445; BIBL. 22 REF.Article

On the angular resolution of planar graphsMALITZ, S; PAPAKOSTAS, A.SIAM journal on discrete mathematics (Print). 1994, Vol 7, Num 2, pp 172-183, issn 0895-4801Article

The equivalent subgraph and directed cut polyhedra on series-parallel graphsSUNIL CHOPRA.SIAM journal on discrete mathematics (Print). 1992, Vol 5, Num 4, pp 475-490, issn 0895-4801Article

On finding critical independent and vertex setsAGEEV, A. A.SIAM journal on discrete mathematics (Print). 1994, Vol 7, Num 2, pp 293-295, issn 0895-4801Article

The poset scheduling problemCHANG, G. J; EDMONDS, J.Order (Dordrecht). 1985, Vol 2, Num 2, pp 113-118, issn 0167-8094Article

An improved algorithm for the planar 3-cut problemXIN HE.Journal of algorithms (Print). 1991, Vol 12, Num 1, pp 23-37, issn 0196-6774Article

The density of a maximum minimal cut in the subset lattice of a finite set is almost oneFENG SHI; WEIXUAN LI.Discrete mathematics. 1993, Vol 123, Num 1-3, pp 111-115, issn 0012-365XArticle

A parallel algorithm evaluating the reliability of a system with known minimal cuts (paths)MALINOWSKI, J; PREUSS, W.Microelectronics and reliability. 1997, Vol 37, Num 2, pp 255-265, issn 0026-2714Article

Reliability bounds for multicriteria systemsMONTERO, J.The Journal of the Operational Research Society. 1993, Vol 44, Num 10, pp 1025-1034, issn 0160-5682Article

Canonical cactus representation for minimum cutsNAGAMOCHI, H; KAMEDA, T.Japan journal of industrial and applied mathematics. 1994, Vol 11, Num 3, pp 343-361, issn 0916-7005Article

Graph connectivity and its augmentation: applications of MA orderingsNAGAMOCHI, Hiroshi; IBARAKI, Toshihide.Discrete applied mathematics. 2002, Vol 123, Num 1-3, pp 447-472, issn 0166-218XConference Paper

Enumeration of minimal cuts of modified networksNAHMAN, J. M.Microelectronics and reliability. 1997, Vol 37, Num 3, pp 483-485, issn 0026-2714Article

Reliability bounds for coherent structures with independent componentsFU, J. C; KOUTRAS, M. V.Statistics & probability letters. 1995, Vol 22, Num 2, pp 137-148, issn 0167-7152Article

A linear time algorithm for computing 3-edge-connected components in a multigraphNAGAMOCHI, H; IBARAKI, T.Japan journal of industrial and applied mathematics. 1992, Vol 9, Num 2, pp 163-180Article

System reliability with common-cause hazard to obey an exponential power modelEL-DAMCESE, M. A.Microelectronics and reliability. 1997, Vol 37, Num 4, pp 605-608, issn 0026-2714Article

A fixed minimal path array method of evaluating reliability indices of power systemsAWOSOPE, C. O. A; AKINBULIRE, T. O.Electric power systems research. 1990, Vol 19, Num 3, pp 167-176, issn 0378-7796, 10 p.Article

  • Page / 2