The complexity of finding temporal separators under waiting time constraints (Q2059911)
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 7444836
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of finding temporal separators under waiting time constraints |
scientific article; zbMATH DE number 7444836 |
Statements
The complexity of finding temporal separators under waiting time constraints (English)
0 references
14 December 2021
0 references
temporal graphs
0 references
computational complexity
0 references
\(\Sigma_2^{\mathrm{P}}\)-completeness
0 references
parameterized complexity
0 references
restless temporal paths
0 references
0.9183092
0 references
0.9183092
0 references
0.8823558
0 references
0.8813955
0 references
0.88139546
0 references
0.8715169
0 references
0.86892974
0 references
0.86892974
0 references
0.85515475
0 references
