Login / Signup
A Generalization of Opsut's Lower Bounds for the Competition Number of a Graph.
Yoshio Sano
Published in:
Graphs Comb. (2013)
Keyphrases
</>
lower bound
computational complexity
small number
neural network
upper bound
random walk
structured data
branch and bound algorithm
graph theoretic
running times
constant factor