C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
On the Parameterized Complexity of Computing Balanced Partitions in Graphs.
René van Bevern
Andreas Emil Feldmann
Manuel Sorge
Ondrej Suchý
Published in:
CoRR (2013)
Keyphrases
</>
parameterized complexity
directed graph
graph theory