Computer Science ›› 2007, Vol. 34 ›› Issue (7): 222-224.

Previous Articles     Next Articles

NING Dan ,WANG Jian-Xin (School of Information Science and Engineering, Central South University, Changsha 410083)   

  • Online:2018-11-16 Published:2018-11-16

Abstract: 3-Dimensional Matching is one of the six classic NP-complete problems, which has extensive application in scheduling, assignment, transportation and network flow problem, etc. Parameterized computation theory is a recently developed new method to study an

Key words: 3-Dimensional matching, Color coding, Dynamic programming

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!