On the parameterized complexity of computing balanced partitions in graphs (Q493645)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the parameterized complexity of computing balanced partitions in graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0 references
0 references
0.9440567
0 references
0.9436958
0 references
0 references
0 references
0.9306493
0 references
0.92930245
0 references
0 references
