The complexity of finding small separators in temporal graphs (Q2009634)
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 7138694
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of finding small separators in temporal graphs |
scientific article; zbMATH DE number 7138694 |
Statements
The complexity of finding small separators in temporal graphs (English)
0 references
29 November 2019
0 references
(non-)strict temporal paths
0 references
temporal core
0 references
single-source shortest paths problem
0 references
single-source shortest strict temporal path
0 references
node multiway cut
0 references
length-bounded cuts
0 references
parameterized complexity
0 references
0.9934236407279968
0 references
0.7361555099487305
0 references
0.7359290719032288
0 references
