On End Vertices of Search Algorithms

Show simple item record

dc.contributor.author Gorzny, Jan
dc.date.accessioned 2015-08-24T18:45:54Z
dc.date.available 2015-08-24T18:45:54Z
dc.date.copyright 2015 en_US
dc.date.issued 2015-08-24
dc.identifier.uri http://hdl.handle.net/1828/6506
dc.description.abstract Given a graph G=(V,E), a vertex ordering of G is a total order v1,v2,...,vn of V. A graph search algorithm is a systematic method for visiting each vertex in a graph, naturally producing a vertex ordering of the graph. We explore the problem of determining whether a given vertex in a graph can be the end (last) vertex of a search ordering for various common graph search algorithms when restricted to various graph classes, as well as the related problem of determining if a vertex is an end-vertex when a start vertex is specified for the search. The former is referred to as the end-vertex problem, and the latter is the beginning-end-vertex problem. For the beginning-end-vertex problem, we show it is NP-complete on bipartite graphs as well as degree restricted bipartite graphs for Lexicographic Breadth First Search, but solvable in polynomial time on split graphs for Breadth First Search. We show that the end-vertex problem is tractable for Lexicographic Breadth First Search on proper interval bigraphs and for Lexicographic Depth First Search on chordal graphs. Further, we show that the problem is NP-complete for Lexicographic Breadth First Search and Depth First Search on bipartite graphs. en_US
dc.language English eng
dc.language.iso en en_US
dc.rights Available to the World Wide Web en_US
dc.rights.uri http://creativecommons.org/publicdomain/zero/1.0/ *
dc.subject graph theory en_US
dc.subject search algorithm en_US
dc.subject end vertex en_US
dc.title On End Vertices of Search Algorithms en_US
dc.type Thesis en_US
dc.contributor.supervisor Huang, Jing
dc.degree.department Department of Mathematics and Statistics en_US
dc.degree.level Master of Science M.Sc. en_US
dc.description.scholarlevel Graduate en_US

Files in this item

The following license files are associated with this item:

This item appears in the following Collection(s)

Show simple item record

Available to the World Wide Web Except where otherwise noted, this item's license is described as Available to the World Wide Web

Search UVicSpace


My Account