Login / Signup
The most congested cutset: deriving a tight lower bound for the chromatic number in the RWA problem.
Ahmad R. Sharafat
Omid Reza Ma'rouzi
Published in:
IEEE Commun. Lett. (2004)
Keyphrases
</>
lower bound
upper bound
small number
neural network
worst case
similarity measure
np hard
constraint programming
memory requirements
maximum number
polynomial approximation