On conflict-free cuts: algorithms and complexity (Q6602320)
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 7910939
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On conflict-free cuts: algorithms and complexity |
scientific article; zbMATH DE number 7910939 |
Statements
On conflict-free cuts: algorithms and complexity (English)
0 references
11 September 2024
0 references
conflict-free cut
0 references
graph algorithms
0 references
computational complexity
0 references
0 references
0.817570149898529
0 references
0.8146794438362122
0 references
0.7779541611671448
0 references
0.7776638865470886
0 references
