On the Parameterized Complexity of Computing Balanced Partitions in Graphs

René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý. On the Parameterized Complexity of Computing Balanced Partitions in Graphs. Theory Comput. Syst., 57(1):1-35, 2015. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.