Faster exponential-time algorithms in graphs of bounded average degree (Q5326575)
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: Faster exponential-time algorithms in graphs of bounded average degree |
scientific article; zbMATH DE number 6195439
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster exponential-time algorithms in graphs of bounded average degree |
scientific article; zbMATH DE number 6195439 |
Statements
Faster Exponential-Time Algorithms in Graphs of Bounded Average Degree (English)
0 references
6 August 2013
0 references
0.936116635799408
0 references
0.8323542475700378
0 references
0.8008060455322266
0 references
0.7951188087463379
0 references
0.779242753982544
0 references
