Finding a minimum path cover of a distance-hereditary graph in polynomial time (Q2457005)
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: Finding a minimum path cover of a distance-hereditary graph in polynomial time |
scientific article; zbMATH DE number 5206096
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding a minimum path cover of a distance-hereditary graph in polynomial time |
scientific article; zbMATH DE number 5206096 |
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
0.8635718822479248
0 references
0.8427343368530273
0 references
0.8058616518974304
0 references
