Disentangling the computational complexity of network untangling (Q6151149)
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 7802705
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Disentangling the computational complexity of network untangling |
scientific article; zbMATH DE number 7802705 |
Statements
Disentangling the computational complexity of network untangling (English)
0 references
9 February 2024
0 references
temporal graph mining
0 references
parameterized algorithmics
0 references
complexity dichotomy
0 references
0.7631592154502869
0 references
0.7400609254837036
0 references
0.7306007742881775
0 references
0.7232341766357422
0 references
0.7225339412689209
0 references
