Advertisement

Abstract

This paper studies the complexity of the Maximum Induced Matching problem (MIM) in regular graphs and trees. We show that the largest induced matchings in a regular graph of degree d can be approximated with a performance ratio less than d. However MIM is NP-hard to approximate within some constant c > 1 even if the input is restricted to various classes of bounded degree and regular graphs. Finally we describe a simple algorithm providing a linear time optimal solution to MIM if the input graph is a tree.

Keywords

Polynomial Time Bipartite Graph Regular Graph Performance Ratio Input Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    N. Alon, U. Feige, A. Wigderson, and D. Zuckerman. Derandomized Graph Products. Computational Complexity, 5:60–75, 1995. 96zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    P. Berman and M. Karpinski. On Some Tighter Inapproximability Results. In Proc. 26th I.C.A.L.P., Springer-Verlag, 1999. 96Google Scholar
  3. 3.
    K. Cameron. Induced Matchings. Discr. Applied Math., 24(1-3):97–102, 1989. 90,98zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    P. Crescenzi. A Short Guide to Approximation Preserving Reductions. In Proc. 12th Conf. on Comput. Complexity, pages 262–273, Ulm, 1997. 93Google Scholar
  5. 5.
    P. Erd?os. Problems and Results in Combinatorial Analysis and Graph Theory. Discr. Math., 72:81–92, 1988. 89CrossRefGoogle Scholar
  6. 6.
    R. J. Faudree, A. Gyárfas, R. H. Schelp, and Z. Tuza. Induced Matchings in Bipartite Graphs. Discr. Math., 78(1-2):83–87, 1989. 89CrossRefzbMATHGoogle Scholar
  7. 7.
    F. Gavril. Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques and Maximum Independent Set of a Chordal Graph. SIAM J. Comp., 1(2):180–187, June 1972. 90, 98zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    M. R. Garey and D. S. Johnson. Computer and Intractability, a Guide to the Theory of NP-Completeness. Freeman and Company, 1979. 94Google Scholar
  9. 9.
    B. Korte and D. Hausmann. An Analysis of the Greedy Heuristic for Independence Systems. Ann. Discr. Math., 2:65–74, 1978. 90zbMATHMathSciNetCrossRefGoogle Scholar
  10. 10.
    S. Khanna and S. Muthukrishnan. Personal communication. 94Google Scholar
  11. 11.
    J. Liu and H. Zhou. Maximum Induced Matchings in Graphs. Discr. Math., 170:277–281, 1997. 89zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994. 93Google Scholar
  13. 13.
    C. H. Papadimitriou and M. Yannakakis. Optimization, Approximation and Complexity Classes. J. Comp. Sys. Sciences, 43:425–440, 1991. 93zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    L. J. Stockmeyer and V. V. Vazirani. NP-Completeness of Some Generalizations of the Maximum Matching Problem. I.P.L., 15(1):14–19, August 1982. 89zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    A. Steger and M. Yu. On Induced Matchings. Discr. Math., 120:291–295, 1993. 89zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Michele Zito
    • 1
  1. 1.Department of Computer ScienceUniversity of LiverpoolLiverpoolUK

Personalised recommendations