Probabilistic Firefighting on the Integer Lattice

In this paper we examine the firefighting problem of graph theory and extend results to setups where firefighters (and then fires) come according to random sequences of coin flips. To solve the problem, we find it helpful to extend firefighting to directed graphs. We answer questions about the integer lattice, the area most commonly studied in firefighting.

Grantor dc:publisher

University of Kansas

Year dc:date.issued

2012

Author dc:creator

• Lambert, Isaac Edward

Advisor dc:contributor.advisor

• Schweig, Jay

• Mathematics

Statement dc:rights

• Copyright held by the author.

Language dc:language.iso

en

Dc Identifier Other

http://dissertations.umi.com/ku:12363

OAI identifier oai:identifier

oai:kuscholarworks.ku.edu:1808/37577