The complexity of computing optimum labelings for temporal connectivity (Q6584065)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of computing optimum labelings for temporal connectivity |
scientific article; zbMATH DE number 7893100
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of computing optimum labelings for temporal connectivity |
scientific article; zbMATH DE number 7893100 |
Statements
The complexity of computing optimum labelings for temporal connectivity (English)
0 references
6 August 2024
0 references
temporal graph
0 references
graph labeling
0 references
foremost temporal path
0 references
temporal connectivity
0 references
Steiner tree
0 references
