Bounds for the number of meeting edges in graph partitioning (Q5355069): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.21136/cmj.2017.0147-16 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2736227478 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:17, 30 July 2024
scientific article; zbMATH DE number 6770127
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
