How fast can we reach a target vertex in stochastic temporal graphs (Q5092333): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.4230/LIPIcs.ICALP.2019.131 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.4230/LIPICS.ICALP.2019.131 / rank | |||
Normal rank | |||
Latest revision as of 15:53, 30 December 2024
scientific article; zbMATH DE number 7561624
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How fast can we reach a target vertex in stochastic temporal graphs |
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
How fast can we reach a target vertex in stochastic temporal graphs (English)
0 references
