Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/817
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Noble, S D | - |
dc.coverage.spatial | 15 | en |
dc.date.accessioned | 2007-05-26T17:13:55Z | - |
dc.date.available | 2007-05-26T17:13:55Z | - |
dc.date.issued | 1998 | - |
dc.identifier.citation | Combinatorics, Probability and Computing, (1998) 7, 307-321 | en |
dc.identifier.issn | 09635483 | - |
dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/817 | - |
dc.description.abstract | It is known that evaluating the Tutte polynomial, $T(G; x, y)$, of a graph, $G$, is $\#$P-hard at all but eight specific points and one specific curve of the $(x, y)$-plane. In contrast we show that if $k$ is a fixed constant then for graphs of tree-width at most $k$ there is an algorithm that will evaluate the polynomial at any point using only a linear number of multiplications and additions. | en |
dc.format.extent | 240885 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | Cambridge University Press | en |
dc.subject | Tutte polynomial | en |
dc.subject | graphs of bounded treewidth | en |
dc.subject | computational complexity | en |
dc.subject | linear time algorithm | en |
dc.title | Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width | en |
dc.type | Research Paper | en |
Appears in Collections: | Computer Science Mathematical Sciences |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.