頁籤選單縮合
題 名 | The Path-Partition Problem in Bipartite Distance-Hereditary Graphs |
---|---|
作 者 | 葉鴻國; 張鎮華; | 書刊名 | Taiwanese Journal of Mathematics |
卷 期 | 2:3 1998.09[民87.09] |
頁 次 | 頁353-360 |
分類號 | 319.76 |
關鍵詞 | Path partition; Distance-hereditary graph; Hamiltonian path; |
語 文 | 英文(English) |
英文摘要 | A path partition of a graph is collection of vertex-disjoint paths that cover all vertices of the graph. The path-partition problem is to find a path partition of minimum size. This paper gives a linear-time algorithm for the path-partition problem in bipartite distance-hereditary graphs. |
本系統中英文摘要資訊取自各篇刊載內容。