Skip to main content
SpringerLink
Log in

On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2204))

Included in the following conference series:

Abstract

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.

This work is supported in part by NSF under Grant CCR-0000206.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Balasubramanian, M, R. Fellows, and V. Raman, An improved fixed parameter algorithm for vertex cover, Information Processing Letters 65, (1998), pp. 163–168.

    Article  MathSciNet  Google Scholar 

  2. R. Beigel and D. Eppstein, 3-coloring in time O(1.3446n): a no-MIS algorithm, Proc. 36th IEEE Symp. on Foundations of Computer Science, (1995), pp. 444–452.

    Google Scholar 

  3. J. Chen, I. A. Kanj, and W. Jia, Vertex cover: further observations and further improvement, Lecture Notes in Computer Science 1665 (WG’99), (1999pp. 313–324.

    Google Scholar 

  4. DIMACS Workshop on Faster Exact Solutions for NP-Hard Problems, Princeton, February 23–24, 2000.

    Google Scholar 

  5. R. G. Downey, M. R. Fellows, and U. Stege, Parameterized complexity: A framework for systematically confronting computational intractability, AMS-DIMACS Proceedings Series 49, F. Roberts, J. Kratochvil, and J. Nesetril, eds., (1999), pp. 49–99.

    Google Scholar 

  6. H. Fernau and R. Niedermeier, An efficient exact algorithm for constraint bipartite vertex cover, Lecture Notes in Computer Science 1672 (MFCS’99), (1999), pp. 387–397.

    Google Scholar 

  7. N. Hasan and C. L. Liu, Minimum fault coverage in reconfigurable arrays, Proc. 18th Int. Symp. on Fault-Tolerant Computing (FTCS’88), (1988), pp. 348–353.

    Google Scholar 

  8. L. Lovász and M. D. Plummer, Matching Theory, Annals of Discrete Mathematics 29, North-Holland, 1986.

    Google Scholar 

  9. C. P. Low and H. W. Leong, A new class of efficient algorithms for reconfiguration of memory arrays, IEEE Trans. Comput. 45, (1996), pp. 614–618.

    Article  MATH  Google Scholar 

  10. S. Micali and V. Vazirani, An \( O\left( {\sqrt {|V|} \cdot |E|} \right) \) algorithm for finding maximum matching in general graphs, Proc. 21st IEEE Symp. on the Foundation of Computer Science, (1980), pp. 17–27.

    Google Scholar 

  11. G. L. Nemhauser and L. E. Trotter, Vertex packing: structural properties and algorithms, Mathematical Programming 8, (1975), pp. 232–248.

    Article  MATH  MathSciNet  Google Scholar 

  12. R. Niedermeier and P. Rossmanith, Upper bounds for vertex cover further improved, Lecture Notes in Computer Science 1563 (STACS’99), (1999), pp. 561–570.

    Google Scholar 

  13. R. Niedermeier and P. Rossmanith, A general method to speed up fixedparameter-tractable algorithms, Information Processing Letters 73, (2000), pp. 125–129.

    Article  MATH  MathSciNet  Google Scholar 

  14. N. J. Nilsson, Principles of Artificial Intelligence, Tioga Publishing Co., 1980.

    Google Scholar 

  15. R. Paturi, P. Pudlak, M. E. Saks, and F. Zane, An improved exponential-time algorithm for k-SAT, Proc. 39th IEEE Symp. on Foundations of Computer Science, (1998), pp. 628–637.

    Google Scholar 

  16. W. Shi and W. K. Fuchs, Probabilistic analysis and algorithms for reconfiguration of memory arrays, IEEE Trans. Computer-Aided Design 11, (1992), pp. 1153–1160.

    Article  Google Scholar 

  17. M. D. Smith and P. Mazumder, Generation of minimal vertex cover for row/column allocation in self-repairable arrays, IEEE Trans. Comput. 45, (1996), pp. 109–115.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Texas A&M University, College Station, TX, 77843-3112, USA

    Jianer Chen & Iyad A. Kanj

Authors
  1. Jianer Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Iyad A. Kanj
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Rostock, 18051, Rostock, Germany

    Andreas Brandstädt  & Van Bang Le  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, J., Kanj, I.A. (2001). On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms. In: Brandstädt, A., Le, V.B. (eds) Graph-Theoretic Concepts in Computer Science. WG 2001. Lecture Notes in Computer Science, vol 2204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45477-2_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-45477-2_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42707-0

  • Online ISBN: 978-3-540-45477-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation