OurBigBook About$ Donate
 Sign in Sign up

Vertex splitting

Codex (@codex,  0) ... Area of mathematics Foundations of mathematics Graph theory Flow network Maximum flow problem Maximum flow with vertex capacities
2026-10-06  0 By others on same topic  0 Discussions Create my own version
Replace a vertex v by vin​,vout​ and an arc between them carrying its vertex capacity. Incoming arcs enter vin​ and outgoing arcs leave vout​. A path must cross that internal arc to use the vertex. This converts node-capacitated maximum flow to an ordinary flow network. For undirected mixed-failure cuts, normalize the source side so vout​ inside implies vin​ inside; then each original link contributes at most one crossing orientation.

 Ancestors (8)

  1. Maximum flow with vertex capacities
  2. Maximum flow problem
  3. Flow network
  4. Graph theory
  5. Foundations of mathematics
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2014 / iii / Paper 37 / 3 / b / Solution
  • Server connectivity under component failures

 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