On the Parameterized Complexity of Computing Balanced Partitions in Graphs › Research Explorer

Novosibirsk State University's Research Portal

On the Parameterized Complexity of Computing Balanced Partitions in Graphs

Research output: Contribution to journal › Article › peer-review

DOI

https://doi.org/10.1007/s00224-014-9557-5
Final published version

René van Bevern
Andreas Emil Feldmann
Manuel Sorge
Ondřej Suchý

Original language	English
Journal	Theory of Computing Systems
Volume	57
Issue number	1
DOIs	https://doi.org/10.1007/s00224-014-9557-5
Publication status	Published - 8 Jul 2015
Externally published	Yes

OECD FOS+WOS

Research areas

Bisection, Cliquewidth, NP-hard problems, Problem kernelization, Treewidth reduction

ID: 22340283