Sign in
Algorithms and Hardness Results for the Maximum Balanced Connected Subgraph Problem.
Yasuaki Kobayashi
Kensuke Kojima
Norihide Matsubara
Taiga Sone
Akihiro Yamamoto
Published in:
COCOA (2019)
Keyphrases
</>
computational complexity
times faster
theoretical analysis
data structure
significant improvement
worst case
orders of magnitude
recently developed
learning algorithm
special case
computationally expensive
graph mining