Description: This project discusses different techniques and algorithms used to solve the parameterized Vertex Cover problem. A vertex cover of a graph G(V,E) is a subset of vertices V such that for every edge (u, v) ⊆ E, at least one of the vertices u or v is in the vertex cover. The best algorithm for this problem is known to run at O(1.2852k+ kn). The optimal solution is intractable, thus optimization strategies in solving the vertex cover problem are brought off-the-shelves, including pre-processing, kernelization, and branching methodologies. A performance bound is considered for approximation algorithms listed in this research.
File list (Check if you may need any files):
VertexCoverNew\App.ico
..............\AssemblyInfo.cs
..............\bin
..............\...\Debug
..............\...\.....\Copy of data.mdb
..............\...\.....\data.mdb
..............\...\.....\VertexCover.exe
..............\data.mdb
..............\Form1.cs
..............\Form1.resx
..............\New Microsoft Word Document.doc
..............\VCover.cs
..............\VCover.resx
..............\Vertex.cs
..............\VertexCover.csproj
..............\VertexCover.csproj.user
..............\VertexCover.sln
..............\VertexCover.sln.old
VertexCoverNew
Download