An improved upper bound on the maximum degree of terminal-pairable complete graphs.

António Girão Gábor Mészáros

Published in: Discret. Math. (2018)

Keyphrases

upper bound
lower bound
graph matching
worst case
branch and bound algorithm
minimum distance
random graphs
branch and bound
lower and upper bounds
graph theoretic
error probability
series parallel
graph model
weighted graph
maximum number
learning algorithm
search algorithm