Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks (Q6179710)
From MaRDI portal
scientific article; zbMATH DE number 7780109
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks |
scientific article; zbMATH DE number 7780109 |
Statements
Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks (English)
0 references
18 December 2023
0 references
edge labeling
0 references
edge scheduled network
0 references
network optimization
0 references
temporal graph
0 references
temporal path
0 references
temporal reachability
0 references
time assignment
0 references
