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: CoRR (2019)
Keyphrases
- directed graph
- undirected graph
- temporal data
- attributed graphs
- temporal reasoning
- monte carlo
- labeled graphs
- temporal information
- hamiltonian cycle
- spatial and temporal
- temporal constraints
- target tracking
- maximum cardinality
- stochastic optimization
- weighted graph
- graph matching
- spatio temporal
- temporal relations
- temporal events
- minimum weight
- connected subgraphs
- spanning tree
- temporal patterns
- temporal databases
- target detection
- graph structure
- average degree
- pairwise