The path-partition problem in bipartite distance-hereditary graphs

Full metadata record

DC Field	Value	Language
dc.contributor.author	Yeh, HG	en_US
dc.contributor.author	Chang, GJ	en_US
dc.date.accessioned	2014-12-08T15:48:46Z	-
dc.date.available	2014-12-08T15:48:46Z	-
dc.date.issued	1998-09-01	en_US
dc.identifier.issn	1027-5487	en_US
dc.identifier.uri	http://hdl.handle.net/11536/32440	-
dc.description.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 find a path partition of minimum size. This paper gives a linear-time algorithm for the path-partition problem in bipartite distance-hereditary graphs.	en_US
dc.language.iso	en_US	en_US
dc.subject	path partition	en_US
dc.subject	distance-hereditary graph	en_US
dc.subject	Hamiltonian path	en_US
dc.title	The path-partition problem in bipartite distance-hereditary graphs	en_US
dc.type	Article	en_US
dc.identifier.journal	TAIWANESE JOURNAL OF MATHEMATICS	en_US
dc.citation.volume	2	en_US
dc.citation.issue	3	en_US
dc.citation.spage	353	en_US
dc.citation.epage	360	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:000078339100009	-
dc.citation.woscount	10	-
Appears in Collections:	Articles