Faster approximation schemes and parameterized algorithms on \(H\)-minor-free and odd-minor-free graphs (Q3586119)
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 5779326
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster approximation schemes and parameterized algorithms on \(H\)-minor-free and odd-minor-free graphs |
scientific article; zbMATH DE number 5779326 |
Statements
Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs (English)
0 references
3 September 2010
0 references
subexponential algorithms
0 references
graph minors
0 references
odd minors
0 references
0.995107352733612
0 references
0.8493154048919678
0 references
0.8485931158065796
0 references
