Constrained minimum vertex cover in bipartite graphs: Complexity and parameterized algorithms

Journal of Computer and System Sciences

Volumn 67, Issue 4, 2003, Pages 833-847

  Chen, Jianer ^a   Kanj, Iyad A ^b  

^a TEXAS A AND M UNIVERSITY   (United States)

^b DEPAUL UNIVERSITY   (United States)

Author keywords

Bipartite graph; Graph matching; Parameterized computation; Vertex cover

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; PROBLEM SOLVING; THEOREM PROVING;

BIPARTITE GRAPH; GRAPH MATCHING; PARAMETERIZED ALGORITHMS;

GRAPH THEORY;

EID: 0348252168     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcss.2003.09.003     Document Type: Article

References (22)

1. R. Balasubramanian, M.R. Fellows, V. Raman, An improved fixed parameter algorithm for vertex cover, Inform. Process. Lett. 65 (1998) 163-168.
2. J. Cheetham, F. Dehne, A. Rau-Chaplin, U. Stege, P.J. Taillon, Solving large FPT problems on coarse grained parallel machines, J. Comput. System Sci., 2004, in press.
3. J. Chen, Introduction to Tractability and Approximability of Optimization Problems, Lecture Notes, Department of Computer Science, Texas A&M University, 2002, available at: http://faculty/cs.tamu.edu/chen/notes/opt.ps.
4. J. Chen, I.A. Kanj, On constrained minimum vertex covers of bipartite graphs: improved algorithms, Proceedings of the 27th International Workshop on Graph-Theoretical Concepts in Computer Science (WG'01), Lecture Notes in Computer Science, Vol. 2204, Springer, Heidelberg, 2001, pp. 55-65.
5. J. Chen, I.A. Kanj, W. Jia, Vertex cover: further observations and further improvement, J. Algorithms 41 (2001) 280-301.
6. DIMACS Workshop on Faster Exact Solutions for NP-Hard Problems, Princeton, February 23-24, 2000.
7. R. Downey, M. Fellows, Parameterized Complexity, Springer, New York, 1999.
8. H. Fernau, R. Niedermeier, An efficient exact algorithm for constraint bipartite vertex cover, J. Algorithms 38 (2001) 374-410.
9. M. Garey, D. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979.
10. N. Hasan, C.L. Liu, Minimum fault coverage in reconfigurable arrays, Proceedings of the 18th International Symposium on Fault-Tolerant Computing (FTCS'88), IEEE Computer Society Press, Los Alamitos, CA, 1988, pp. 348-353.
11. F. Henglein, H.G. Mairson, The complexity of type inference for higher order typed lambda calculi, J. Funct. Programming 4 (1994) 435-477.
12. S.-Y. Kuo, W. Fuchs, Efficient spare allocation for reconfigurable arrays, IEEE Des. Test 4 (1987) 24-31.
13. O. Lichtenstein, A. Pneuli, Checking that finite-state concurrents programs satisfy their linear specification, Proceedings of the 12th ACM Symposium on Principles of Programming Languages (POPL), ACM Press, New York, NY, 1985, pp. 97-107.
14. L. Lovász, M.D. Plummer, Matching Theory, in: Annals of Discrete Mathematics, Vol. 29, North-Holland, Amsterdam, 1986.
15. C.P. Low, H.W. Leong, A new class of efficient algorithms for reconfiguration of memory arrays, IEEE Trans. Comput. 45 (1996) 614-618.
16. S. Micali, V. Vazirani, An O(√|V| · |E|) algorithm for finding maximum matching in general graphs, Proceedings of the 21st IEEE Symposium on the Foundation of Computer Science (FOCS'80), IEEE Computer Society Press, Los Alamitos, CA, 1980, pp. 17-27.
17. G.L. Nemhauser, L.E. Trotter, Vertex packing: structural properties and algorithms, Math. Programming 8 (1975) 232-248.
18. R. Niedermeier, P. Rossmanith, Upper bounds for vertex cover further improved, Proceedings of the 16th Symposium on Theoretical Aspects of Computer Science (STACS'99), Lecture Notes in Computer Science, Vol. 1563, Springer, Heidelberg, 1999, pp. 561-570.
19. R. Niedermeier, P. Rossmanith, A general method to speed up fixed-parameter-tractable algorithms, Inform. Process. Lett. 73 (2000) 125-129.
20. N.J. Nilsson, Principles of Artificial Intelligence, Tioga Publishing Co., Palo Alto, CA, 1980.
21. J.M. Robson, Algorithms for maximum independent sets, J. Algorithms 7 (1986) 425-440.
22. M.D. Smith, P. Mazumder, Generation of minimal vertex cover for row/column allocation in self-repairable arrays, IEEE Trans. Comput. 45 (1996) 109-115.