An Improved Upper Bound for the Finite Delay of Graphs.
Bostjan VilfanPublished in: IEEE Trans. Computers (1970)
Keyphrases
- upper bound
- lower bound
- branch and bound algorithm
- graph theoretic
- directed graph
- sample complexity
- weighted graph
- graph matching
- worst case
- graph clustering
- branch and bound
- objective function
- bipartite graph
- finite number
- lower and upper bounds
- graph representation
- graph partitioning
- graph theory
- series parallel
- small world
- error probability
- path length
- generalization error
- complex structures
- graph databases
- graph model
- graph mining
- real time
- structured data
- shortest path
- social networks
- neural network