https://github.com/lothrazar/lowmemorygraphtraversal
Masters Thesis 2010
https://github.com/lothrazar/lowmemorygraphtraversal
Last synced: 5 months ago
JSON representation
Masters Thesis 2010
- Host: GitHub
- URL: https://github.com/lothrazar/lowmemorygraphtraversal
- Owner: Lothrazar
- Created: 2016-12-03T19:43:25.000Z (over 9 years ago)
- Default Branch: master
- Last Pushed: 2016-12-03T20:15:30.000Z (over 9 years ago)
- Last Synced: 2025-04-06T22:42:48.621Z (about 1 year ago)
- Language: TeX
- Size: 3.17 MB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# LowMemoryGraphTraversal
Masters Thesis 2010
The main file is SamBassettMScThesis.tex
The presentation is samMSCdefense.tex
The final published version is copied in the /publishedDownload/ folder, in case the links below ever go down.
Written and complied using LaTeX markup language using emacs : http://www.latex-project.org/about/ https://www.gnu.org/software/emacs/
Images created using Xfig: http://xfig.org/
Build: use pdflatex command line program. For details: http://aty.sdsu.edu/bibliog/latex/LaTeXtoPDF.html
Sam Bassett, all rights reserved.
Published : http://summit.sfu.ca/item/11413
Replication of abstract and publication info:
Author: Bassett, Samson Kenneth Ray
Date created: 2010-08-23
Identifier: etd6191
Keywords: Graph Traversal Routing Online Periodic Geometric
Abstract:
We provide two traversal algorithms. First, we demonstrate that there exists a local orientation for any anonymous graph G, provided that G is not a star graph, and G does not have any induced subgraph that is isomorphic to a path on four vertices. We show that it is possible to periodically traverse G with period at most 2n - 2; this matches the lower bound for the period for general graphs. Next, we provide a traversal for labelled graphs given that they satisfy two properties, which we define. The properties that we define and use are inspired by the properties of geometric planar graphs.
Document type: Thesis
Rights: Copyright remains with the author. The author granted permission for the file to be printed and for the text to be copied and pasted.
Senior supervisor: Ladislav Stacho
Department: Science: Department of Mathematics
Thesis type: (Thesis) M.Sc.
Direct Download: http://summit.sfu.ca/system/files/iritems1/11413/etd6191_SBassett.pdf
Another reference https://www.sfu.ca/math/research_groups/discrete_mathematics/recent_theses.html
Note: *caption files are not my own, they are part of a downloaded caption package for LaTex *