An upper bound for the Hamiltonicity exponent of finite digraphs.
Günter SchaarA. Pawel WojdaPublished in: Discret. Math. (1997)
Keyphrases
- learning environment
- upper bound
- lower bound
- branch and bound algorithm
- upper and lower bounds
- worst case
- branch and bound
- lower and upper bounds
- generalization error
- error probability
- unit length
- equivalence classes
- vc dimension
- directed graph
- bayesian networks
- real time
- optimal solution
- training data
- knowledge base
- data mining
- databases
- constant factor
- database