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 the normal view instead:
scientific article; zbMATH DE number 6244629
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8084601163864136
0 references
0.7900197505950928
0 references
0.7815352082252502
0 references
0.7767015695571899
0 references
