摘要
A path partition of a graph is a 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.
| 原文 | ???core.languages.en_GB??? |
|---|---|
| 頁（從 - 到） | 353-360 |
| 頁數 | 8 |
| 期刊 | Taiwanese Journal of Mathematics |
| 卷 | 2 |
| 發行號 | 3 |
| DOIs | |
| 出版狀態 | 已出版 - 9月 1998 |