Bounds for the number of meeting edges in graph partitioning. (Q5355069)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6770127
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounds for the number of meeting edges in graph partitioning. |
scientific article; zbMATH DE number 6770127 |
Statements
Bounds for the number of meeting edges in graph partitioning (English)
0 references
6 September 2017
0 references
weighted hypergraph
0 references
partition
0 references
judicious partition
0 references
0.8958420157432556
0 references
0.850342869758606
0 references
0.8175654411315918
0 references
0.8175616264343262
0 references
0.7995012402534485
0 references
