NOTE: This item is not available outside the Texas A&M University network. Texas A&M affiliated users who are off campus can access the item through NetID and password authentication or by using TAMU VPN. Non-affiliated individuals should request a copy through their local library's interlibrary loan service.
Improved vertex cover algorithms for fixed genus graphs through genus reduction and planar separation
| dc.creator | Gupton, Kevin Thomas | |
| dc.date.accessioned | 2012-06-07T23:20:23Z | |
| dc.date.available | 2012-06-07T23:20:23Z | |
| dc.date.created | 2003 | |
| dc.date.issued | 2003 | |
| dc.identifier.uri | https://hdl.handle.net/1969.1/ETD-TAMU-2003-THESIS-G88 | |
| dc.description | Due to the character of the original source materials and the nature of batch digitization, quality control issues may be present in this document. Please report any quality issues you encounter to digital@library.tamu.edu, referencing the URI of the item. | en |
| dc.description | Includes bibliographical references (leaves 42-43). | en |
| dc.description | Issued also on microfiche from Lange Micrographics. | en |
| dc.description.abstract | There have been increasing efforts to find improved solutions to the VERTEX COVER problem and other NP-hard problems. The latest solving algorithms have shown progress in reducing the theoretical worst-case time complexity of finding solutions, and have also proven to be invaluable in practical applications. In this thesis, we take a new approach to solving VERTEX COVER by utilizing the topological properties of graphs. For graphs of fixed genus, we present algorithms to solve the parameterized VERTEX COVER problem in time O(kn+k³)+2⁰(vk) . | en |
| dc.format.medium | electronic | en |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en_US | |
| dc.publisher | Texas A&M University | |
| dc.rights | This thesis was part of a retrospective digitization project authorized by the Texas A&M University Libraries in 2008. Copyright remains vested with the author(s). It is the user's responsibility to secure permission from the copyright holder(s) for re-use of the work beyond the provision of Fair Use. | en |
| dc.subject | computer science. | en |
| dc.subject | Major computer science. | en |
| dc.title | Improved vertex cover algorithms for fixed genus graphs through genus reduction and planar separation | en |
| dc.type | Thesis | en |
| thesis.degree.discipline | computer science | en |
| thesis.degree.name | M.S. | en |
| thesis.degree.level | Masters | en |
| dc.type.genre | thesis | en |
| dc.type.material | text | en |
| dc.format.digitalOrigin | reformatted digital | en |
Files in this item
This item appears in the following Collection(s)
-
Digitized Theses and Dissertations (1922–2004)
Texas A&M University Theses and Dissertations (1922–2004)
Request Open Access
This item and its contents are restricted. If this is your thesis or dissertation, you can make it open-access. This will allow all visitors to view the contents of the thesis.