Search
Now showing items 1-1 of 1
Improved vertex cover algorithms for fixed genus graphs through genus reduction and planar separation
(Texas A&M University, 2003)
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 ...