Login / Signup
On the Parameterized Complexity of Computing Balanced Partitions in Graphs.
René van Bevern
Andreas Emil Feldmann
Manuel Sorge
Ondrej Suchý
Published in:
Theory Comput. Syst. (2015)
Keyphrases
</>
parameterized complexity
global constraints
fixed parameter tractable
vertex set
graph theoretic
knowledge base
directed graph
graph structure
weighted graph
search algorithm
np complete
constraint programming
partial order
graph theory