The maximum k-plex problem is a computationally complex problem, which
emerged from graph-theoretic social network studies. This paper presents an
Use your arXiv email address to see your arXiv papers in Ground AI.
By signing up you accept our content policy
Already have an account? Sign in
No a member yet? Create an account