Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks (Q6179710)
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 7780109
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.7375698089599609
0 references
0.7138722538948059
0 references
0.6930071711540222
0 references
0.6875930428504944
0 references
0.679053544998169
0 references
