BIROn - Birkbeck Institutional Research Online

Browse by Person

Up a level
Export as [feed] Atom [feed] RSS
Jump to: 1985 | 1987 | 1996 | 2000
Number of items: 4.

1985

Bollobas, B. and Fenner, Trevor and Frieze, A.M. (1985) An algorithm for finding Hamilton cycles in a random graph. In: Sedgewick, R. (ed.) Proceedings of the 17th Annual ACM Symposium on Theory of Computing. ACM, pp. 430-439. ISBN 9780897911511.

1987

Bollobas, B. and Fenner, Trevor and Frieze, A.M. (1987) An algorithm for finding Hamilton cycles in a random graph. Combinatorica 7 (4), pp. 327-341. ISSN 0209-9683.

1996

Bollobas, B. and Fenner, Trevor and Frieze, A.M. (1996) On the best case of heapsort. Journal of Algorithms 20 (2), pp. 205-217. ISSN 0196-6774.

2000

Bollobas, B. and Cooper, C. and Fenner, Trevor and Frieze, A.M. (2000) Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least \emphk. Journal of Graph Theory 34 (1), pp. 42-59. ISSN 0364-9024.

This list was generated on Mon Apr 14 02:36:04 2025 BST.