Quartz 4

Home

❯

Non Bipartie Matching via M Alternating Paths

Non-Bipartie Matching via M-Alternating Paths

Dec 06, 20251 min read

  • uni/AA

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 v4.5.1 © 2025

  • GitHub
  • Discord Community