An exact algorithm based on chain implication for the Min-CVCB problem

Authors:
Jianxin Wang;Xiaoshuang Xu;Yunlong Liu
Affiliations:
College of Information Science and Engineering, Central South University, Changsha, China;College of Information Science and Engineering, Central South University, Changsha, China;College of Information Science and Engineering, Central South University, Changsha, China
Venue:
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Year:
2007

Citing 8
Cited 2

Complexity of Fault Diagnosis in Comparison Models

IEEE Transactions on Computers
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 efficient exact algorithm for constraint bipartite vertex cover

Journal of Algorithms
Vertex cover: further observations and further improvements

Journal of Algorithms
Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms

Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Efficient Spare Allocation for Reconfigurable Arrays

IEEE Design & Test
Parameterized Complexity

Parameterized Complexity

Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations

FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Constraint bipartite vertex cover: simpler exact algorithms and implementations

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The constrained minimum vertex cover problem on bipartite graphs (the Min-CVCB problem), with important applications in the study of reconfigurable arrays in VLSI design, is an NP-hard problem and has attracted considerable attention in the literature. Based on a deeper and more careful analysis on the structures of bipartite graphs, we develop an exact algorithm of running time O((ku+kl)|G|+1.1892ku+kl), which improves the best previous algorithm of running time O((ku + kl)|G| + 1.26ku+kl) for the problem.