ON MATCHINGS AND HAMILTON CYCLES IN RANDOM GRAPHS

[1]  Martin E. Dyer,et al.  On patching algorithms for random asymmetric travelling salesman problems , 1990, Math. Program..

[2]  Béla Bollobás,et al.  A Tribute to Paul Erdős: Hamilton cycles in random graphs of minimal degree at least k , 1990 .

[3]  Alan M. Frieze,et al.  On the number of hamilton cycles in a random graph , 1989, J. Graph Theory.

[4]  Alan M. Frieze.  An Algorithm for Finding Hamilton Cycles in Random Directed Graphs , 1988, J. Algorithms.

[5]  Tomasz Luczak,et al.  On k-leaf connectivity of a random graph , 1988, J. Graph Theory.

[6]  Alan M. Frieze,et al.  Finding hamilton cycles in sparse random graphs , 1987, J. Comb. Theory, Ser. B.

[7]  Alan M. Frieze,et al.  Partitioning random graphs into large cycles , 1988, Discret. Math..

[8]  Alan M. Frieze.  On the Exact Solution of Random Travelling Salesman Problems with Medium Size Integer Coefficients , 1987, SIAM J. Comput..

[9]  B. Bollobás,et al.  An algorithm for finding hamilton paths and cycles in random graphs , 1987 .

[10]  Prabhakar Raghavan,et al.  Parallel graph algorithms that are efficient on average , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[11]  Saharon Shelah,et al.  Expected Computation Time for Hamiltonian Path Problem , 1987, SIAM J. Comput..

[12]  Alan M. Frieze.  Parallel Algorithms for Finding Hamilton Cycles in Random Graphs , 1987, Inf. Process. Lett..

[13]  Vijay V. Vazirani,et al.  Matching is as easy as matrix inversion , 1987, STOC.

[14]  R. Karp.  An Upper Bound on the Expected Cost of an Optimal Assignment , 1987 .

[15]  Edward R. Scheinerman,et al.  Hamiltonian Closure in Random Graphs , 1987 .

[16]  Tomasz Łuczak,et al.  On Matchings and Hamiltonian Cycles in Subgraphs of Random Graphs , 1987 .

[17]  Alan M. Frieze.  On large matchings and cycles in sparse random graphs , 1986, Discret. Math..

[18]  Martin E. Dyer,et al.  On linear programs with random costs , 1986, Math. Program..

[19]  Alan M. Frieze.  Maximum matchings in a class of random graphs , 1986, J. Comb. Theory, Ser. B.

[20]  Alan M. Frieze.  Limit Distribution for the Existence of Hamiltonian Cycles in Random Bipartite Graphs , 1985, Eur. J. Comb..

[21]  Eli Upfal,et al.  Constructing a perfect matching is in random NC , 1985, STOC '85.

[22]  J. Komlos,et al.  First Occurrence of Hamilton Cycles in Random Graphs , 1985 .

[23]  Nicholas C. Wormald,et al.  On Hamilton Cycles in 3-Connected Cubic Maps , 1985 .

[24]  Alan M. Frieze,et al.  Hamiltonian cycles in random regular graphs , 1984, J. Comb. Theory, Ser. B.

[25]  Nicholas C. Wormald,et al.  Existence of long cycles in random cubic graphs , 1984 .

[26]  B. Bollobás.  The evolution of random graphs , 1984 .

[27]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[28]  Eli Shamir,et al.  How many random edges make a graph hamiltonian? , 1983, Comb..

[29]  T.I. Fenner,et al.  On the existence of Hamiltonian cycles in a class of random graphs , 1983, Discret. Math..

[30]  A. Frieze,et al.  On the connectivity of randomm-orientable graphs and digraphs , 1982 .

[31]  Béla Bollobás.  Long paths in sparse random graphs , 1982, Comb..

[32]  Eli Upfal,et al.  One-factor in random graphs based on vertex choice , 1982, Discret. Math..

[33]  Colin McDiarmid.  General percolation and random graphs , 1981, Advances in Applied Probability.

[34]  János Komlós,et al.  The longest path in a random graph , 1981, Comb..

[35]  Richard M. Karp,et al.  Maximum Matchings in Sparse Random Graphs , 1981, FOCS 1981.

[36]  Béla Bollobás,et al.  A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..

[37]  Richard M. Karp,et al.  An algorithm to solve the m × n assignment problem in expected time O(mn log n) , 1980, Networks.

[38]  David W. Walkup,et al.  Matchings in random regular bipartite digraphs , 1980, Discret. Math..

[39]  Richard M. Karp,et al.  A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem , 1979, SIAM J. Comput..

[40]  David W. Walkup,et al.  On the Expected Value of a Random Assignment Problem , 1979, SIAM J. Comput..

[41]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[42]  Richard M. Karp,et al.  Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane , 1977, Math. Oper. Res..

[43]  Leslie G. Valiant,et al.  Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.

[44]  L. Pósa,et al.  Hamiltonian circuits in random graphs , 1976, Discret. Math..

[45]  John Adrian Bondy,et al.  A method in graph theory , 1976, Discret. Math..

[46]  J. Moon,et al.  The expected node-independence number of random trees , 1973 .

[47]  P. Erdos,et al.  On the existence of a factor of degree one of a connected random graph , 1966 .

[48]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[49]  J. Beardwood,et al.  The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.

[50]  W. T. Tutte.  The Factorization of Linear Graphs , 1947 .