Improved vertex cover algorithms for fixed genus graphs through genus reduction and planar separation /

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 app...

Full description

Bibliographic Details

Main Author:	Gupton, Kevin Thomas, 1978-
Format:	Thesis eBook
Language:	English
Published:	[Place of publication not identified] : [publisher not identified] ; 2003.
Subjects:	Major computer science.
Online Access:	Link to OAKTrust copy