Login / Signup
A linear time algorithm for a variant of the max cut problem in series parallel graphs.
Brahim Chaourar
Published in:
CoRR (2016)
Keyphrases
</>
series parallel
temporal reasoning
binary trees
max cut
tree decomposition
random graphs
search space
graph theoretic