A fast practical algorithm for the vertex separation of unicyclic graphs

Simple item page
dc.contributor.authorMarkov, Minko Marinov.en_US
dc.contributor.supervisorEllis, John Arthuren_US
dc.date.accessioned2008-04-10T06:01:02Z
dc.date.available2008-04-10T06:01:02Z
dc.date.copyright2004en_US
dc.date.issued2008-04-10T06:01:02Z
dc.degree.departmentDept. of Computer Scienceen_US
dc.description.abstractThe vertex separation of a graph is the minimum vertex separation of a linear layout of that graph over all its linear layouts. A linear layout of a graph is an arrangement of its vertices in a line and the vertex separation of a linear layout is maximum number of vertices to the left of any intervertex "gap" that are adjacent to vertices to the right of that gap, over all gaps. A unicyclic graph is a connected graph with precisely one cycle that is, a tree plus an extra edge. We present a O(n lgn) algorithm to compute the optimal vertex separation of unicyclic graphs. The algorithm is "practical" in the sense that it is easily implementable. Furthermore, the algorithm outputs a layout for the unicyclic graph of minimum vertex separation.en_US
dc.identifier.urihttp://hdl.handle.net/1828/612
dc.subject.lcshGraph theoryen_US
dc.subject.lcshAlgorithmsen_US
dc.titleA fast practical algorithm for the vertex separation of unicyclic graphsen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
markov_2004.pdf
Size:
4.36 MB
Format:
Adobe Portable Document Format
Download

Collections

ETD (Electronic Theses and Dissertations)
Theses (Computer Science)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.