Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs (Q764332): Difference between revisions
From MaRDI portal
Latest revision as of 00:28, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs |
scientific article |
Statements
Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs (English)
0 references
13 March 2012
0 references
subexponential algorithms
0 references
graph minors
0 references
odd minors
0 references
0 references
0 references
0 references