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: J. Comput. Syst. Sci. (2020)
Keyphrases
- directed graph
- undirected graph
- attributed graphs
- spatio temporal
- labeled graphs
- spatial and temporal
- temporal constraints
- temporal information
- hamiltonian cycle
- monte carlo
- temporal reasoning
- temporal data
- maximum cardinality
- temporal patterns
- graph theoretic
- edge weights
- stochastic model
- graph theory
- bipartite graph
- graph matching
- graph mining
- graph databases
- graph structure
- graph clustering
- learning automata
- space time