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.

• Type: Conference
• Year: 2008
• Where: FAW
• Authors: Guoqiang Bai 0002, Henning Fernau
• Keywords: Algorithms, Constraint Bipartite Vertex, FAW 2008, Parameterized Algorithm, Spare Allocation Problem