Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs (Q3586119): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:06, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs |
scientific article |
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
