Login / Signup
A New Upper Bound Based on Vertex Partitioning for the Maximum K-plex Problem.
Hua Jiang
Dongming Zhu
Zhichao Xie
Shaowen Yao
Zhang-Hua Fu
Published in:
IJCAI (2021)
Keyphrases
</>
upper bound
lower bound
minimum distance
worst case
branch and bound algorithm
lower and upper bounds
vertex set
upper and lower bounds
branch and bound
generalization error
maximum number
partitioning algorithm
artificial intelligence
multiscale
error probability