MINIMUM PATHS IN DIRECTED GRAPHS.FRIEZE A.1977; OPER. RES. QUART.; G.B.; DA. 1977; VOL. 28; NO 2I; PP. 339-346; BIBL. 7 REF.Article

An algorithm for finding Hamilton cycles in randon directed graphsFRIEZE, A. M.Journal of algorithms (Print). 1988, Vol 9, Num 3, pp 181-204, issn 0196-6774Article

Maximum matchings in a class of random graphsFRIEZE, A. M.Journal of combinatorial theory. Series B. 1986, Vol 40, Num 2, pp 196-212, issn 0095-8956Article

On the independence number of random graphsFRIEZE, A. M.Discrete mathematics. 1990, Vol 81, Num 2, pp 171-175, issn 0012-365X, 5 p.Article

Probabilistic analysis of graph algorithmsFRIEZE, A. M.Computing. Supplementum (Wien). 1990, Num 7, pp 209-233, issn 0344-8029, 25 p.Article

Partitioning random graphs into large cyclesFRIEZE, A. M.Discrete mathematics. 1988, Vol 70, Num 2, pp 149-158, issn 0012-365XArticle

Parallel algorithms for finding hamilton cycles in random graphsFRIEZE, A. M.Information processing letters. 1987, Vol 25, Num 2, pp 111-117, issn 0020-0190Article

On the Lagarias-Odlyzko algorithm for the subset sum problemFRIEZE, A. M.SIAM journal on computing (Print). 1986, Vol 15, Num 2, pp 536-539, issn 0097-5397Article

Algebraic flowsFRIEZE, A. M.North-Holland mathematics studies. 1984, Vol 95, pp 135-146, issn 0304-0208Article

Greedy algorithms for the shortest common superstring that are asymptotically optimalFRIEZE, A; SZPANKOWSKI, W.Algorithmica. 1998, Vol 21, Num 1, pp 21-36, issn 0178-4617Conference Paper

Polychromatic Hamilton cyclesFRIEZE, A; REED, B.Discrete mathematics. 1993, Vol 118, Num 1-3, pp 69-74, issn 0012-365XArticle

The limiting probability that α-In, β-out is strongly connectedCOOPER, C; FRIEZE, A. M.Journal of combinatorial theory. Series B. 1990, Vol 48, Num 1, pp 117-134, issn 0095-8956Article

On the number of Hamilton cycles in a random graphCOOPER, C; FRIEZE, A. M.Journal of graph theory. 1989, Vol 13, Num 6, pp 719-735, issn 0364-9024, 17 p.Article

Large induced trees in sparse random graphsFRIEZE, A. M; JACKSON, B.Journal of combinatorial theory. Series B. 1987, Vol 42, Num 2, pp 181-195, issn 0095-8956Article

Random walks, totally unimodular matrices, and a randomised dual simplex algorithmDYER, M; FRIEZE, A.Mathematical programming. 1994, Vol 64, Num 1, pp 1-16, issn 0025-5610Article

A new integer programming formulation for the permutation flowshop problemFRIEZE, A. M; YADEGAR, J.European journal of operational research. 1989, Vol 40, Num 1, pp 90-98, issn 0377-2217, 9 p.Article

Analysis of two simple heuristics on a random instance of k-SATFRIEZE, A; SUEN, S.Journal of algorithms (Print). 1996, Vol 20, Num 2, pp 312-355, issn 0196-6774Article

Large holes in sparse random graphsFRIEZE, A. M; JACKSON, B.Combinatorica (Print). 1987, Vol 7, Num 3, pp 265-274, issn 0209-9683Article

Generating and counting Hamilton cycles in random regular graphsFRIEZE, A; JERRUM, M; MOLLOY, M et al.Journal of algorithms (Print). 1996, Vol 21, Num 1, pp 176-198, issn 0196-6774Article

Approximately counting hamilton paths and cycles in dense graphsDYER, M; FRIEZE, A; JERRUM, M et al.SIAM journal on computing (Print). 1998, Vol 27, Num 5, pp 1262-1272, issn 0097-5397Article

Average-case complexity of shortest-paths problems in the vertex-potential modelCOOPER, C; FRIEZE, A; MEHLHORN, K et al.Lecture notes in computer science. 1997, pp 15-26, issn 0302-9743, isbn 3-540-63248-4Conference Paper

On key storage in secure networksDYER, M; FENNER, T; FRIEZE, A et al.Journal of cryptology. 1995, Vol 8, Num 4, pp 189-200, issn 0933-2790Article

On balls and bins with deletionsCOLE, R; FRIEZE, A; MAGGS, B. M et al.Lecture notes in computer science. 1998, pp 145-158, issn 0302-9743, isbn 3-540-65142-XConference Paper

When is the assignment bound tight for the asymmetric traveling-salesman problem ?FRIEZE, A; KARP, R. M; REED, B et al.SIAM journal on computing (Print). 1995, Vol 24, Num 3, pp 484-493, issn 0097-5397Article

Probabilistic analysis of a relaxation for the k-median problemSANG AHN; COOPER, C; CORNUEJOLS, G et al.Mathematics of operations research. 1988, Vol 13, Num 1, pp 1-31, issn 0364-765XArticle