Dense graph partitioning on sparse and dense graphs (Q6544072)
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: Dense graph partitioning on sparse and dense graphs |
scientific article; zbMATH DE number 7853685
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dense graph partitioning on sparse and dense graphs |
scientific article; zbMATH DE number 7853685 |
Statements
Dense graph partitioning on sparse and dense graphs (English)
0 references
27 May 2024
0 references
NP-hardness
0 references
approximation
0 references
density
0 references
graph partitioning
0 references
bipartite graphs
0 references
cubic graphs
0 references
dense graphs
0 references
0.85501629114151
0 references
0.7908658981323242
0 references
0.7898353934288025
0 references
0.7879407405853271
0 references
0.7812167406082153
0 references
