(Strong) conflict-free connectivity: algorithm and complexity (Q2283032)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | (Strong) conflict-free connectivity: algorithm and complexity |
scientific article |
Statements
(Strong) conflict-free connectivity: algorithm and complexity (English)
0 references
27 December 2019
0 references
conflict-free connection
0 references
polynomial-time algorithm
0 references
strong conflict-free connection
0 references
complexity
0 references
0 references
