Finding good decompositions for dynamic programming on dense graphs (Q2891352)
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: Finding good decompositions for dynamic programming on dense graphs |
scientific article; zbMATH DE number 6046509
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding good decompositions for dynamic programming on dense graphs |
scientific article; zbMATH DE number 6046509 |
Statements
Finding Good Decompositions for Dynamic Programming on Dense Graphs (English)
0 references
15 June 2012
0 references
0.8446504473686218
0 references
0.8382056951522827
0 references
0.8275317549705505
0 references
0.7952859401702881
0 references
0.7897800207138062
0 references
