Sketchy Notes on Edmonds’ Incredible Shrinking Blossom Algorithm for General Matching



Download 1.17 Mb.
Page1/19
Date conversion02.05.2018
Size1.17 Mb.
  1   2   3   4   5   6   7   8   9   ...   19
COS 423 Theory of Algorithms

Spring 2007





Sketchy Notes on Edmonds’ Incredible Shrinking Blossom Algorithm for General Matching

Consider an alternating even-length path from a free vertex to a vertex plus an odd-length alternating cycle from
  1   2   3   4   5   6   7   8   9   ...   19


The database is protected by copyright ©ininet.org 2016
send message

    Main page