Quartz 5

Home

❯

Non-Bipartie Matching via M-Alternating Paths

Non-Bipartie Matching via M-Alternating Paths

Properties2
tagsuni/aa
aliasesAugmenting paths in non-bipartite graphs, Blossom Algorithmus

Sep 22, 20261 min read

Satz von Berge
M-augmenting Path

Graph Flower
Every path with exposed Endpoints is either a Flower or M-alternating
Modify Flowers
Schrinking a blossom

Algotithm

Runtime


Graph View

  • Algotithm
  • Runtime

Backlinks

  • AA Flashcards Maximum Matching and Flows
  • M-augmenting Path
  • Matching
  • Maximum Matching

Created with Quartz v5.0.0 © 2026

  • GitHub
  • Discord Community