登入選單
返回Google圖書搜尋
Perfect Matching for Regular Graphs is ${\rm{AC}}[superscript]{\circ}$-hard for the General Matching Problem
出版1987
URLhttp://books.google.com.hk/books?id=aZwKPwAACAAJ&hl=&source=gbs_api