Principles of artificial intelligence
Principles of artificial intelligence
A New Class Of Efficient Algorithms For Reconfiguration Of Memory Arrays
IEEE Transactions on Computers
Generation of Minimal Vertex Covers for Row/Column Allocation in Self-Repairable Arrays
IEEE Transactions on Computers
An improved fixed-parameter algorithm for vertex cover
Information Processing Letters
A general method to speed up fixed-parameter-tractable algorithms
Information Processing Letters
An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Vertex Cover: Further Observations and Further Improvements
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
3-coloring in time 0(1.3446^n): a no-MIS algorithm
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
An Improved Exponential-Time Algorithm for k-SAT
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Upper bounds for vertex cover further improved
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
| Hi-index | 0.00 |
The constrained minimum vertex cover problem on bipartite graphs arises from the extensively studied fault coverage problem for reconfigurable arrays. In this paper, we develop a new algorithm for the problem, in which classical results in matching theory and recently developed techniques in parameterized computation are nicely combined and extended. The algorithm is practically efficient with running time bounded by O(1.26k + kn), where k is the size of the constrained minimum vertex cover in the input graph. The algorithm is a significant improvement over the previous algorithms for the problem.