How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs?
Eleni C. AkridaGeorge B. MertziosSotiris E. NikoletseasChristoforos L. RaptopoulosPaul G. SpirakisViktor ZamaraevPublished in: ICALP (2019)
Keyphrases
- directed graph
- undirected graph
- attributed graphs
- labeled graphs
- monte carlo
- spatio temporal
- temporal patterns
- connected subgraphs
- temporal dimension
- temporal constraints
- graph matching
- hamiltonian cycle
- temporal data
- temporal databases
- graph theory
- temporal reasoning
- temporal information
- graph representation
- vertex set
- complex structures
- graph partitioning
- target tracking
- graph theoretic
- edge weights
- stochastic optimization
- target detection
- minimum weight
- graph model
- connected components
- spatial and temporal
- space time