An efficient partitioning oracle for bounded-treewidth graphs (Q3088124)
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 5940181
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient partitioning oracle for bounded-treewidth graphs |
scientific article; zbMATH DE number 5940181 |
Statements
An Efficient Partitioning Oracle for Bounded-Treewidth Graphs (English)
0 references
17 August 2011
0 references
0 references
0.745133101940155
0 references
0.7399435043334961
0 references
0.739432156085968
0 references
