Published in

Springer (part of Springer Nature), Theory of Computing Systems, 1(57), p. 1-35

DOI: 10.1007/s00224-014-9557-5

Links

Tools

Export citation

Search in Google Scholar

On the Parameterized Complexity of Computing Balanced Partitions in Graphs

Journal article published in 2014 by René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondřej Suchý
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Green circle
Postprint: archiving allowed
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO