BIROn - Birkbeck Institutional Research Online

    Browse by Person

    Up a level
    Export as [feed] Atom [feed] RSS
    Group by: Item Type | Date | Journal or Publication Title | No Grouping
    Number of items: 8.

    BIT Numerical Mathematics

    Fenner, Trevor and Frieze, A.M. (1985) An algorithm for finding a matroid basis which maximizes the products of the weights of the elements. BIT Numerical Mathematics 25 (3), pp. 433-438. ISSN 0006-3835.

    Combinatorica

    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.

    Fenner, Trevor and Frieze, A.M. (1982) On the connectivity of random m-orientable graphs and digraphs. Combinatorica 2 (4), pp. 347-359. ISSN 0209-9683.

    Discrete Mathematics

    Fenner, Trevor and Frieze, A.M. (1983) On the existence of Hamiltonian cycles in a class of random graphs. Discrete Mathematics 45 (2-3), pp. 301-305. ISSN 0012-365X.

    Journal of Algorithms

    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.

    Journal of Combinatorial Theory, Series B

    Fenner, Trevor and Frieze, A.M. (1984) Hamiltonian cycles in random regular graphs. Journal of Combinatorial Theory, Series B 37 (2), pp. 103-112. ISSN 0095-8956.

    Journal of Cryptology

    Dyer, M. and Fenner, Trevor and Frieze, A.M. and Thomason, A. (1995) On key storage in secure networks. Journal of Cryptology 8 (4), pp. 189-200. ISSN 0933-2790.

    Journal of Graph Theory

    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 Dec 23 06:40:08 2024 GMT.