LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs (Q2848201)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs |
scientific article |
Statements
LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs (English)
0 references
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
