Finding long directed cycles is hard even when DFVS is small or girth is large (Q6657027)
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 long directed cycles is hard even when DFVS is small or girth is large |
scientific article; zbMATH DE number 7961910
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding long directed cycles is hard even when DFVS is small or girth is large |
scientific article; zbMATH DE number 7961910 |
Statements
Finding long directed cycles is hard even when DFVS is small or girth is large (English)
0 references
6 January 2025
0 references
Hamiltonian cycle
0 references
longest path
0 references
directed feedback vertex set
0 references
directed graphs
0 references
parameterized complexity
0 references
