Login / Signup
Algorithms and Hardness Results for the Maximum Balanced Connected Subgraph Problem.
Yasuaki Kobayashi
Kensuke Kojima
Norihide Matsubara
Taiga Sone
Akihiro Yamamoto
Published in:
CoRR (2019)
Keyphrases
</>
theoretical analysis
learning algorithm
data sets
computational complexity
worst case
computational efficiency
neural network
lower bound
xml documents
np hard
optimization problems
benchmark datasets
orders of magnitude
times faster