The Path Partition Problem In Bipartite Distance Hereditary Graphs
Work
Year: 1998
Type: article
Abstract: 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 nd a path partition of minimum size. This paper gives a line... more
Source: Taiwanese Journal of Mathematics
Authors Hong-Gwa Yeh, Gerard J. Chang
Institution National Yang Ming Chiao Tung University
Cites: 15
Cited by: 16
Related to: 10
FWCI: 0.874
Citation percentile (by year/subfield): 74.35
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Reduced inequalities
Open Access status: bronze