Finding Good Decompositions for Dynamic Programming on Dense Graphs (Q2891352): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: DIMACS / rank | |||
Normal rank | |||
Revision as of 10:24, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding Good Decompositions for Dynamic Programming on Dense Graphs |
scientific article |
Statements
Finding Good Decompositions for Dynamic Programming on Dense Graphs (English)
0 references
15 June 2012
0 references
