The complexity of finding small separators in temporal graphs (Q2009634): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q127392267, #quickstatements; #temporary_batch_1723827951581 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127392267 / rank | |||
Normal rank | |||
Revision as of 18:15, 16 August 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
