"Approximability of the Minimum Maximal Matching Problem in Planar Graphs."

Hiroshi Nagamochi, Yukihiro Nishida, Toshihide Ibaraki (2003)

> Home

Details and statistics

DOI: —

access: closed

type: Journal Article

metadata version: 2021-06-08

- view
  - electronic edition @ ieice.org
- export record
  dblp key:
  - journals/ieiceta/NagamochiNI03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ieiceta/NagamochiNI03
Hiroshi Nagamochi, Yukihiro Nishida, Toshihide Ibaraki:
Approximability of the Minimum Maximal Matching Problem in Planar Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(12): 3251-3258 (2003)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.