登入選單
返回Google圖書搜尋
On Parallel Complexity of Matching for Chordal and Path Graphs
Mathematical Sciences Research Institute (Berkeley, Calif.)Elias DahlhausM. Karpinski
出版Mathematical Sciences Research Institute, 1987
URLhttp://books.google.com.hk/books?id=Rj4DHwAACAAJ&hl=&source=gbs_api