Finding, hitting and packing cycles in subexponential time on unit disk graphs (Q2334507): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 447 / rank | |||
Normal rank | |||
Revision as of 01:05, 1 March 2024
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
