An upper bound for the depth-r interval number of the complete graph.

Markus Eckstein

Published in: Ars Comb. (1996)

Keyphrases

upper bound
neural network
three dimensional
lower bound
small number
directed graph
graph model
graph representation
search engine
high quality
probabilistic model
np complete
random walk
branch and bound algorithm
graph structure
maximum number