Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization (Q2343085)
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: Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization |
scientific article; zbMATH DE number 6432670
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization |
scientific article; zbMATH DE number 6432670 |
Statements
Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization (English)
0 references
4 May 2015
0 references
parameterized complexity
0 references
FPT
0 references
greedy
0 references
branching
0 references
local partitioning problems
0 references
0 references
0.9614462852478028
0 references
0.7490441203117371
0 references
0.7366087436676025
0 references
