LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs (Q2848201)
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: LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs |
scientific article; zbMATH DE number 6211587
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs |
scientific article; zbMATH DE number 6211587 |
Statements
25 September 2013
0 references
cocomparability graphs
0 references
minimum path cover problem
0 references
Hamiltonian path problem
0 references
lexicographic depth first search
0 references
posets
0 references
bump number
0 references
0.93954337
0 references
0.86538273
0 references
0.8498769
0 references
0.8454788
0 references
0.84175503
0 references
0 references
0.8408059
0 references
0 references
LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs (English)
0 references
