Finding, hitting and packing cycles in subexponential time on unit disk graphs (Q2334507): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q128616642, #quickstatements; #temporary_batch_1723924200075 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00454-018-00054-x / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00454-018-00054-X / rank | |||
Normal rank | |||
Latest revision as of 01:38, 18 December 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
0 references
0 references
0 references
0 references
