Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/15891
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Noble, S | - |
dc.contributor.advisor | Hall, R | - |
dc.contributor.author | Knapp, Christopher N. | - |
dc.date.accessioned | 2018-02-28T16:36:08Z | - |
dc.date.available | 2018-02-28T16:36:08Z | - |
dc.date.issued | 2018 | - |
dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/15891 | - |
dc.description | This thesis was submitted for the award of Doctor of Philosophy and was awarded by Brunel University London | en_US |
dc.description.abstract | We consider the computational complexity of evaluating the Tutte polynomial of three particular classes of greedoid, namely rooted graphs, rooted digraphs and binary greedoids. Furthermore we construct polynomial-time algorithms to evaluate the Tutte polynomial of these classes of greedoid when they’re of bounded tree-width. We also construct a Möbius function formulation for the characteristic polynomial of a rooted graph and determine the computational complexity of computing the coefficients of the Tutte polynomial of a rooted graph. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Brunel University London | en_US |
dc.relation.uri | http://bura.brunel.ac.uk/bitstream/2438/15891/1/FulltextThesis.pdf | - |
dc.subject | Rooted graphs | en_US |
dc.subject | Rooted digraphs | en_US |
dc.subject | Binary greedoids | en_US |
dc.subject | Algorithm | en_US |
dc.subject | Matroids | en_US |
dc.title | The complexity of greedoid Tutte polynomials | en_US |
dc.type | Thesis | en_US |
Appears in Collections: | Dept of Mathematics Theses |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
FulltextThesis.pdf | 738.63 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.