On the parameterized complexity of computing balanced partitions in graphs (Q493645): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:26, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the parameterized complexity of computing balanced partitions in graphs |
scientific article |
Statements
On the parameterized complexity of computing balanced partitions in graphs (English)
0 references
4 September 2015
0 references
bisection
0 references
NP-hard problems
0 references
problem kernelization
0 references
cliquewidth
0 references
treewidth reduction
0 references
