Login / Signup
Complexity and inapproximability results for balanced connected subgraph problem.
Timothée Martinod
Valentin Pollet
Benoît Darties
Rodolphe Giroudeau
Jean-Claude König
Published in:
Theor. Comput. Sci. (2021)
Keyphrases
</>
approximation algorithms
space complexity
machine learning
artificial intelligence
computer vision
computational complexity
np hard
worst case
connected components
neural network
metadata
training set
computational cost