BIROn - Birkbeck Institutional Research Online

    Complexity of graph polynomials

    Noble, Steven (2007) Complexity of graph polynomials. In: McDiarmid, C.J.H. and Grimmett, G.R. (eds.) Combinatorics, Complexity and Chance: A Tribute to Dominic Welsh. Oxford, UK: Oxford University Press. ISBN 9780198571278.

    Full text not available from this repository.

    Abstract

    This chapter examines the complexity of evaluating graph polynomials, related to the Tutte polynomial, for various classes of matroids. It begins with a short introduction to matroids, complexity, and the Tutte polynomial. The intractability results for the Tutte polynomial are then discussed, including proof of the most often quoted result of classifying the hard points for evaluation of the Tutte polynomial in the graphic case. Contrasting results are presented, giving polynomial time algorithms for restricted classes of input, particularly graphs with bounded tree-width. Finally, the complexity results for various classes of matroids are presented.

    Metadata

    Item Type: Book Section
    School: School of Business, Economics & Informatics > Economics, Mathematics and Statistics
    Depositing User: Sarah Hall
    Date Deposited: 20 Jul 2020 11:34
    Last Modified: 28 Jul 2020 09:44
    URI: https://eprints.bbk.ac.uk/id/eprint/32599

    Statistics

    Downloads
    Activity Overview
    0Downloads
    23Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item