Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors (Q1774147)
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: Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors |
scientific article; zbMATH DE number 2162506
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors |
scientific article; zbMATH DE number 2162506 |
Statements
Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors (English)
0 references
29 April 2005
0 references
exponential speedup
0 references
planar graphs
0 references
0.8193725943565369
0 references
0.8165545463562012
0 references
0.8149074912071228
0 references
