Sciweavers

Share
FAW
2008
Springer

Constraint Bipartite Vertex Cover: Simpler Exact Algorithms and Implementations

9 years 2 days ago
Constraint Bipartite Vertex Cover: Simpler Exact Algorithms and Implementations
constraint bipartite vertex cover is a graph-theoretical formalization of the spare allocation problem for reconfigurable arrays. We report on an implementation of a parameterized algorithm for this problem. This has led to considerable simplifications of the published, quite sophisticated algorithm. Moreover, we can prove that the mentioned algorithm could be quite efficient in practial situations.
Guoqiang Bai 0002, Henning Fernau
Added 19 Oct 2010
Updated 19 Oct 2010
Type Conference
Year 2008
Where FAW
Authors Guoqiang Bai 0002, Henning Fernau
Comments (0)
books