Use this URL to cite or link to this record in EThOS:
Title: The complexity of greedoid Tutte polynomials
Author: Knapp, Christopher N.
ISNI:       0000 0004 7658 5033
Awarding Body: Brunel University London
Current Institution: Brunel University
Date of Award: 2018
Availability of Full Text:
Access from EThOS:
Access from Institution:
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.
Supervisor: Noble, S. ; Hall, R. Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available
Keywords: Rooted graphs ; Rooted digraphs ; Binary greedoids ; Algorithm ; Matroids