Problemcore
Graph partitioning problem
Also called minimum bisection, balanced graph partition.
Split vertices into balanced parts while minimizing the number of cut edges.
Split vertices into balanced parts while minimizing the number of cut edges.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 8P17R0 Edit this page History Report an error