Noble, Steven (2007) Complexity of graph polynomials. In: Grimmett, G. and McDiarmid, C. (eds.) Combinatorics, Complexity, and Chance: A Tribute to Dominic Welsh. Oxford Academic, pp. 191-212. ISBN 9780198571278.
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 |
|---|---|
| Keyword(s) / Subject(s): | graph polynomials, Tutte polynomial, matroids, graphs, polynomial time algorithms |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Administrator |
| Date Deposited: | 06 Jan 2023 16:30 |
| Last Modified: | 09 Aug 2023 12:54 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/50387 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
