Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems (Q392025)
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: Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems |
scientific article; zbMATH DE number 6244629
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems |
scientific article; zbMATH DE number 6244629 |
Statements
Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems (English)
0 references
13 January 2014
0 references
