登入選單
返回Google圖書搜尋
An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph
International Computer Science InstituteE. DahlhausM. Karpinski
出版International Computer Science Inst., 1989
URLhttp://books.google.com.hk/books?id=5OOvcQAACAAJ&hl=&source=gbs_api