(Strong) conflict-free connectivity: algorithm and complexity (Q2283032)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7146694
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | (Strong) conflict-free connectivity: algorithm and complexity |
scientific article; zbMATH DE number 7146694 |
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
0.9352914690971376
0 references
0.8971341252326965
0 references
0.8833250403404236
0 references
0.8705100417137146
0 references
0.8484715223312378
0 references
