A collection of algorithmic and complexity results for variants of the Firefighter Problem
| dc.contributor.author | Duffy, Christopher | |
| dc.contributor.supervisor | MacGillivray, Gary | |
| dc.date.accessioned | 2011-09-02T18:15:54Z | |
| dc.date.available | 2011-09-02T18:15:54Z | |
| dc.date.copyright | 2011 | en_US |
| dc.date.issued | 2011-09-02 | |
| dc.degree.department | Department of Mathematics and Statistics | |
| dc.degree.level | Master of Science M.Sc. | en_US |
| dc.description.abstract | The Firefighter Process models the spread and defence of a fire using a simple graph. We consider the following discrete-time process: at t = 0 some vertex of the graph begins burning. At each subsequent step we may defend a vertex from burning and the fire spreads from all burning vertices to all undefended neighbours. We consider the related problems of maximising the number of saved vertices, protecting a specified set from burning and maximising the weight of the saved vertices. We close three open problems concerning these decision problems and their related optimisation problems using the notion of a strategy, the sequence of defended vertices. | en_US |
| dc.description.scholarlevel | Graduate | en_US |
| dc.identifier.uri | http://hdl.handle.net/1828/3550 | |
| dc.language | English | eng |
| dc.language.iso | en | en_US |
| dc.rights.temp | Available to the World Wide Web | en_US |
| dc.subject | Graph Theory | en_US |
| dc.subject | Complexity | en_US |
| dc.subject | Firefighter | en_US |
| dc.title | A collection of algorithmic and complexity results for variants of the Firefighter Problem | en_US |
| dc.type | Thesis | en_US |