Problemintro
Flow decomposition
Also called path and cycle decomposition of a flow.
Write a flow as a sum of s-t paths and cycles carrying the flow values.
Write a flow as a sum of s-t paths and cycles carrying the flow values.
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 5JW6R2 Edit this page History Report an error