The path-partition problem in bipartite distance-hereditary graphs (Q1272711)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The path-partition problem in bipartite distance-hereditary graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The path-partition problem in bipartite distance-hereditary graphs |
scientific article |
Statements
The path-partition problem in bipartite distance-hereditary graphs (English)
0 references
3 January 1999
0 references
A graph is distance-hereditary if every two vertices in a connected induced subgraph have the same distance as in the original graph. A polynomial algorithm is obtained for finding a minimum number of paths to cover the vertex set of a distance-hereditary graph.
0 references
path-covering
0 references
distance-hereditary
0 references
polynomial algorithm
0 references
