Some Performance Bounds of Strategies for Graph Exploration.
Alessandro RivaAlberto Quattrini LiFrancesco AmigoniPublished in: AAMAS (2015)
Keyphrases
- upper bound
- graph representation
- lower bound
- exploration strategy
- directed graph
- search strategies
- graph theory
- spanning tree
- random walk
- structured data
- worst case
- graph theoretic
- bipartite graph
- undirected graph
- graph mining
- graph search
- graph based algorithm
- dependency graph
- directed acyclic graph
- stable set
- graph partitioning
- graph model
- neural network
- graph matching
- connected components
- genetic algorithm