Finding a minimum path cover of a distance-hereditary graph in polynomial time (Q2457005)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding a minimum path cover of a distance-hereditary graph in polynomial time |
scientific article |
Statements
Finding a minimum path cover of a distance-hereditary graph in polynomial time (English)
0 references
29 October 2007
0 references
Graph algorithms
0 references
Hamiltonian path
0 references
path cover
0 references
distance-hereditary graphs
0 references
0 references
0 references
0 references
