Parameterized complexity of conflict-free matchings and paths (Q2182094)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized complexity of conflict-free matchings and paths |
scientific article |
Statements
Parameterized complexity of conflict-free matchings and paths (English)
0 references
21 May 2020
0 references
conflict-free matching
0 references
shortest path
0 references
FPT algorithm
0 references
W[1]-hardness
0 references
matroid
0 references
0 references
0 references
0 references
0 references
