LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs (Q2848201): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/11083856x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1986137691 / rank | |||
Normal rank | |||
Latest revision as of 10:21, 30 July 2024
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
