Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended (Q5881345)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7661703
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended |
scientific article; zbMATH DE number 7661703 |
Statements
Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended (English)
0 references
9 March 2023
0 references
0 references
0 references
0.9080142974853516
0 references
0.8009691834449768
0 references
0.7623014450073242
0 references
0.7293696403503418
0 references
0.7180008292198181
0 references
