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((k_u+k_l)|G|+1.1892^{k_u+k_l})\), which improves the best previous algorithm of running time \(O((k_u+k_l)|G|+1.26^{k_u+k_l})\) for the problem.
This research is supported by the National Natural Science Foundation of China (60433020), the Program for New Century Excellent Talents in University (NCET-05-0683) and the Program for Changjiang Scholars and Innovative Research Team in University (IRT0661)
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hasan, N., Liu, C.L.: Minimum Fault Coverage in Reconfigurable Arrays. In: Pro of the 18th International Symposium on Fault-Tolerant Computing (FTCS 1988), pp. 348–353. IEEE Computer Society Press, Los Alamitos,CA (1988)
Niosson, N.J.: Principles of Artificial Intelligence. Tioga Publishing Co., Palo Alto, CA (1980)
Kuo, S.Y., Fuchs, W.: Efficient spare allocation for reconfigurable arrays. IEEE Des. Test 4, 24–31 (1987)
Blough, D.M., Pelc, A.: Complexity of fault diagnosis in comparison models. IEEE Trans.Comput. 41(3), 318–323 (1992)
Low, C.P., Leong, H.W.: A new class of efficient algorithms for reconfiguration of memery arrays. IEEE Trans. Comput. 45(1), 614–618 (1996)
Smith, M.D., Mazumder, P.: Generation of minimal vertex cover for row/column allocation in self-repairable arrays. IEEE Trans.Comput. 45, 109–115 (1996)
Downey, R., Fellows, M.: Parameterized Complexity. Springer, New York (1999)
Fernau, H., Niedermeier, R.: An efficient exact algorithm for constraint bipartite vertex cover. J.Algorithms 38, 374–410 (2001)
Chen, J., Kanj, I.A.: Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms. Journal of Computer and System Science 67, 833–847 (2003)
Lovasz, L., Plummer, M.D.: Matching Theory. In: Annals of Discrete Mathematics, vol. 29, North-Holland, Amsterdam (1986)
Chen, J., Kanj, I.A., Jia, W.: Vertex cover: further observations and further improvements. Journal of Algorithms, 280–301 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, J., Xu, X., Liu, Y. (2007). An Exact Algorithm Based on Chain Implication for the Min-CVCB Problem. In: Dress, A., Xu, Y., Zhu, B. (eds) Combinatorial Optimization and Applications. COCOA 2007. Lecture Notes in Computer Science, vol 4616. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73556-4_36
Download citation
DOI: https://doi.org/10.1007/978-3-540-73556-4_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73555-7
Online ISBN: 978-3-540-73556-4
eBook Packages: Computer ScienceComputer Science (R0)