Approximability of the Minimum Maximal Matching Problem in Planar Graphs

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E86-A, Issue 12, 2003, Pages 3251-3258

  Nagamochi, Hiroshi ^a   Nishida, Yukihiro ^b   Ibaraki, Toshihide ^c  

^a TOYOHASHI UNIVERSITY OF TECHNOLOGY   (Japan)

^b Japan Research Inst Ltd   (Japan)

^c KYOTO UNIVERSITY   (Japan)

Author keywords

Approximation algorithm; Graph algorithm; Matching; Planar graph; Separator

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

APPROXIMATION ALGORITHM; GRAPH ALGORITHM; MATCHING; PLANAR GRAPH; SEPARATOR;

GRAPH THEORY;

EID: 0842267421     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (15)

1. B.S. Baker, "Approximation algorithms for NP-complete problems on planar graphs," J. Assoc. Comput. Mach., vol.41, pp.153-180, 1994.
2. T. Biedl, E.D. Demaine, C.A. Duncan, R. Fleischer, and S.G. Kobourov, "Tight bounds on maximal and maximum matchings," ISAAC 2001, Lecture Notes in Computer Science, Springer, vol.2223, pp.308-319, 2001.
3. T. Fujito, "On approximability of the independent/connected edge dominating set problems," Inf. Process. Lett., vol.79, pp.261-266, 2001.
4. T. Fujito and H. Nagamochi, "A 2-approximation algorithm for the minimum weight edge dominating set problem," Discrete Applied Mathematics, vol.118, pp.199-208, 2002.
5. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, 1979.
6. F. Harray, Graph Theory, Addison-Wesley, Reading, MA, 1969.
7. D. Lichtenstein, "Planar formulae and their uses," SIAM J. Comput., vol.11, pp.329-343, 1982.
8. R.J. Lipton and R.E. Tarjan, "A separator theorem for planar graphs," SIAM J. Appl. Math., vol.36, pp.177-189, 1979.
9. R.J. Lipton and R.E. Tarjan, "Applications of a planar separator theorem," SIAM J. Comput., vol.9, pp.615-627, 1980.
10. C.L. Liu, Introduction to Combinatorial Mathematics, McGraw-Hill, New York, 1968.
11. 1/2|E|) algorithm for finding maximum matching in general graphs," Proc. 21st Annual IEEE Symp. on Foundations of Computer Science, pp.17-27, 1980.
12. T. Nishizeki and I. Baybars, "Lower bounds on the cardinality of the maximum matchings of planar graphs," Discrete Math., vol.28, pp.255-267, 1979.
13. T. Nishizeki and N. Chiba, Planar Graphs: Theory and Algorithm, North-Holland, 1988.
14. R.E. Tarjan, "Depth-first search and linear graph algorithm," SIAM J. Comput., vol.1, pp.146-160, 1972.
15. M. Yannakakis and F. Gavril, "Edge dominating sets in graphs," SIAM J. Appl. Math., vol.38, pp.364-372, 1980.