An upper bound on the cover time for powers of graphs.
Johan JonassonPublished in: Discret. Math. (2000)
Keyphrases
- upper bound
- lower bound
- branch and bound algorithm
- upper and lower bounds
- worst case
- graph theory
- graph theoretic
- graph representation
- graph matching
- graph structure
- graph databases
- pattern recognition
- graph partitioning
- branch and bound
- directed graph
- database
- sample complexity
- pairwise
- single item
- error probability
- graph isomorphism