![]() | Up a level |
Number of items: 2.
B
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.
L
Lewis, Gail (1985) From deepest Kilburn. In: Heron, L. (ed.) Truth, Dare, Promise: Girls Growing Up in the Fifties. London, UK: Virago, pp. 213-236. ISBN 9780860685968.