Finding, hitting and packing cycles in subexponential time on unit disk graphs (Q5111396)
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: Finding, hitting and packing cycles in subexponential time on unit disk graphs |
scientific article; zbMATH DE number 7204517
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding, hitting and packing cycles in subexponential time on unit disk graphs |
scientific article; zbMATH DE number 7204517 |
Statements
27 May 2020
0 references
longest cycle
0 references
cycle packing
0 references
feedback vertex set
0 references
unit disk graph
0 references
parameterized complexity
0 references
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs (English)
0 references
0.9979129433631896
0 references
0.8656347990036011
0 references
0.783902645111084
0 references
0.782773494720459
0 references
