Citation
Hg. Yeh et Gj. Chang, The path-partition problem in bipartite distance-hereditary graphs, TAIWAN J M, 2(3), 1998, pp. 353-360
Citations number
17
Categorie Soggetti
Mathematics
Journal title
TAIWANESE JOURNAL OF MATHEMATICS
ISSN journal
10275487
→ ACNP
Volume
2
Issue
3
Year of publication
1998
Pages
353 - 360
Database
ISI
SICI code
1027-5487(199809)2:3<353:TPPIBD>2.0.ZU;2-N
Abstract
A path partition of a graph is a collection of vertex-disjoint paths that c
over all vertices of the graph. The path-partition problem is to find a pat
h partition of minimum size. This paper gives a linear-time algorithm for t
he path-partition problem in bipartite distance-hereditary graphs.