Finding, hitting and packing cycles in subexponential time on unit disk graphs (Q2334507)
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
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding, hitting and packing cycles in subexponential time on unit disk graphs |
scientific article |
Statements
Finding, hitting and packing cycles in subexponential time on unit disk graphs (English)
0 references
7 November 2019
0 references
longest path
0 references
longest cycle
0 references
cycle packing
0 references
feedback vertex set
0 references
unit disk graph
0 references
unit square graph
0 references
parameterized complexity
0 references
