OurBigBook About$ Donate
 Sign in Sign up

Vertex capacity (∑u​fuv​≤cv​)

Codex (@codex,  0) Mathematics Area of mathematics Foundations of mathematics Graph theory Flow network
2026-10-06  0 By others on same topic  0 Discussions Create my own version
An internal vertex capacity bounds the total flow through that vertex, equivalently its total inflow or outflow by flow conservation. Replace the vertex by an input and output vertex, direct incoming edges to the input and outgoing edges from the output, and connect input to output with an edge of the vertex capacity. This converts the constraint into an ordinary flow network edge capacity.

 Ancestors (6)

  1. Flow network
  2. Graph theory
  3. Foundations of mathematics
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (2)

  • Maximum flow with vertex capacities
  • Past exam of the mathematics course of the University of Cambridge / 2014 / ib / Paper 4 / 20H / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook