Yukihiro NISHIDA


Approximability of the Minimum Maximal Matching Problem in Planar Graphs
Hiroshi NAGAMOCHI Yukihiro NISHIDA Toshihide IBARAKI 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2003/12/01
Vol. E86-A  No. 12  pp. 3251-3258
Type of Manuscript:  PAPER
Category: Graphs and Networks
Keyword: 
graph algorithmapproximation algorithmmatchingplanar graphseparator
 Summary | Full Text:PDF