Approximation and parameterized algorithms to find balanced connected partitions of graphs.

Phablo F. S. Moura Matheus Jun Ota Yoshiko Wakabayashi

Published in: CoRR (2021)

Keyphrases

computational cost
learning algorithm
error bounds
theoretical analysis
neural network
data structure
graph theory
computational complexity
significant improvement
worst case
optimization problems
orders of magnitude