Keyword : perfect matching


Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings
Takehiro ITO Naoki SAKAMOTO Xiao ZHOU Takao NISHIZEKI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2011/02/01
Vol. E94-D  No. 2 ; pp. 190-195
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science -- Mathematical Foundations and Applications of Algorithms and Computer Science --)
Category: 
Keyword: 
algorithmcost edge-coloringmultitreeperfect matchingtree
 Summary | Full Text:PDF

Approximated Vertex Cover for Graphs with Perfect Matchings
Tomokazu IMAMURA Kazuo IWAMA Tatsuie TSUKIJI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2006/08/01
Vol. E89-D  No. 8 ; pp. 2405-2410
Type of Manuscript:  INVITED PAPER (Special Section on Invited Papers from New Horizons in Computing)
Category: 
Keyword: 
approximation algorithmvertex coverperfect matchingMAX-2SAT
 Summary | Full Text:PDF