No label defined (Q5092333)
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: How fast can we reach a target vertex in stochastic temporal graphs |
scientific article; zbMATH DE number 7561624
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | No label defined |
scientific article; zbMATH DE number 7561624 |
Statements
21 July 2022
0 references
temporal network
0 references
stochastic temporal graph
0 references
temporal path
0 references
\#P-hard problem
0 references
polynomial-time approximation scheme
0 references
0 references
0 references
