The complexity of finding small separators in temporal graphs (Q2009634): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: cliques / rank | |||
Normal rank | |||
Revision as of 04:53, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of finding small separators in temporal graphs |
scientific article |
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
