一個一致的方法解決雙分排列圖上樹寬和最少填入邊問題 = = A uni...
彭勝龍

Linked to FindBook      Google Book      Amazon      博客來     
  • 一個一致的方法解決雙分排列圖上樹寬和最少填入邊問題 = = A unified approach for treewidth and minimum fill-in problems on bipartite permutation graphs /
  • Record Type: Language materials, printed : Monograph/item
    Title/Author: 一個一致的方法解決雙分排列圖上樹寬和最少填入邊問題 = / 林俊榮撰
    Reminder of title: A unified approach for treewidth and minimum fill-in problems on bipartite permutation graphs /
    remainder title: A unified approach for treewidth and minimum fill-in problems on bipartite permutation graphs
    Author: 林俊榮
    other author: 彭勝龍
    Published: 民91[2002],
    Description: vii,35葉 : 圖,表格 ; 30公分
    Notes: 內容為英文
    Subject: 最少填入邊 -
    Subject: bipartite permutation graphs -
Location:  Year:  Volume Number: 
Items
  • 1 records • Pages 1 •
 
GE0031124 五樓論文區 (5F Theses & Dissertations) 03.不外借_N 本校碩士論文 T 312.9 4429 一般使用(Normal) On shelf 0
  • 1 records • Pages 1 •
Reviews
Export
pickup library
 
 
Change password
Login