Lower bounds for node search number on grid-like graphs

dc.contributor.authorWarren, Robert Bramwell
dc.contributor.supervisorEllis, John Arthur
dc.date.accessioned2010-02-10T21:57:17Z
dc.date.available2010-02-10T21:57:17Z
dc.date.copyright2005en
dc.date.issued2010-02-10T21:57:17Z
dc.degree.departmentDept. of Computer Scienceen
dc.degree.levelMaster of Science M.Sc.en
dc.description.abstractOne method to find the node search number of a graph is to prove identical upper and lower bounds. In four types of grid-like graphs. (h. w)-grids. cylinders. orb webs. and walls, upper bounds are easy to see. However. for tori, the upper bounds are less obvious. requiring two different search strategies. In all cases the lower bounds are not obvious and previously unproven. For these five classes of graphs we develop several techniques for proving lower bounds by taking advantage of the fact that re-contamination does help. We observe that in the five classes of graphs we examine, the node search number can be expressed as a function of the height and width of the graph.en
dc.identifier.urihttp://hdl.handle.net/1828/2179
dc.languageEnglisheng
dc.language.isoenen
dc.rightsAvailable to the World Wide Weben
dc.subjectgraph theoryen
dc.subjectcomputable functionsen
dc.subject.lcshUVic Subject Index::Sciences and Engineering::Applied Sciences::Computer scienceen
dc.titleLower bounds for node search number on grid-like graphsen
dc.typeThesisen

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Warren_R_MSc.pdf
Size:
21.53 MB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.83 KB
Format:
Item-specific license agreed upon to submission
Description: