{"id":18150245,"url":"https://github.com/lothrazar/lowmemorygraphtraversal","last_synced_at":"2026-01-19T13:33:13.619Z","repository":{"id":146016466,"uuid":"75496212","full_name":"Lothrazar/LowMemoryGraphTraversal","owner":"Lothrazar","description":"Masters Thesis 2010","archived":false,"fork":false,"pushed_at":"2016-12-03T20:15:30.000Z","size":3329,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-04-06T22:42:48.621Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"TeX","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Lothrazar.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2016-12-03T19:43:25.000Z","updated_at":"2016-12-03T20:06:14.000Z","dependencies_parsed_at":"2023-05-25T15:15:32.081Z","dependency_job_id":null,"html_url":"https://github.com/Lothrazar/LowMemoryGraphTraversal","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Lothrazar/LowMemoryGraphTraversal","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Lothrazar%2FLowMemoryGraphTraversal","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Lothrazar%2FLowMemoryGraphTraversal/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Lothrazar%2FLowMemoryGraphTraversal/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Lothrazar%2FLowMemoryGraphTraversal/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Lothrazar","download_url":"https://codeload.github.com/Lothrazar/LowMemoryGraphTraversal/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Lothrazar%2FLowMemoryGraphTraversal/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28569233,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-19T12:50:50.164Z","status":"ssl_error","status_checked_at":"2026-01-19T12:50:42.704Z","response_time":67,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-11-02T00:08:20.001Z","updated_at":"2026-01-19T13:33:13.614Z","avatar_url":"https://github.com/Lothrazar.png","language":"TeX","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LowMemoryGraphTraversal\nMasters Thesis 2010\n\n\nThe main file is SamBassettMScThesis.tex\n\nThe presentation is samMSCdefense.tex\n\nThe final published version is copied in the /publishedDownload/ folder, in case the links below ever go down.  \n\nWritten and complied using LaTeX markup language using emacs : http://www.latex-project.org/about/  https://www.gnu.org/software/emacs/\n\nImages created using Xfig: http://xfig.org/\n\nBuild: use pdflatex command line program.  For details: http://aty.sdsu.edu/bibliog/latex/LaTeXtoPDF.html\n\nSam Bassett, all rights reserved.  \n\nPublished : http://summit.sfu.ca/item/11413  \n\nReplication of abstract and publication info: \n\nAuthor: Bassett, Samson Kenneth Ray\n\nDate created: 2010-08-23\n\nIdentifier: etd6191\n\nKeywords: Graph Traversal Routing Online Periodic Geometric\n\nAbstract: \nWe 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.\n\nDocument type: Thesis\n\nRights: Copyright remains with the author. The author granted permission for the file to be printed and for the text to be copied and pasted.\n\nSenior supervisor: Ladislav Stacho\n\nDepartment: Science: Department of Mathematics\n\nThesis type: (Thesis) M.Sc.\n\nDirect Download: http://summit.sfu.ca/system/files/iritems1/11413/etd6191_SBassett.pdf\n\nAnother reference https://www.sfu.ca/math/research_groups/discrete_mathematics/recent_theses.html\n\n\nNote: *caption files are not my own, they are part of a downloaded caption package for LaTex *\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flothrazar%2Flowmemorygraphtraversal","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Flothrazar%2Flowmemorygraphtraversal","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flothrazar%2Flowmemorygraphtraversal/lists"}