"On the Parameterized Complexity of Computing Balanced Partitions in Graphs."

René van Bevern et al. (2015)

> Home

Details and statistics

DOI: 10.1007/S00224-014-9557-5

access: closed

type: Journal Article

metadata version: 2025-05-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mst/BevernFSS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/BevernFSS15
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)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.