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 + k l)|G| + 1.26ku+kl) for the problem. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Wang, J., Xu, X., & Liu, Y. (2007). An exact algorithm based on chain implication for the min-CVCB problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4616 LNCS, pp. 343–353). Springer Verlag. https://doi.org/10.1007/978-3-540-73556-4_36
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
