Counter sample for Kuhn's maximum matching algorithm.

Правка en1, от radoslav11, 2017-07-16 15:58:36

Hello!

My question is simple. Can someone give me a test sample for maximum matching in bipartite graphs on which Kuhn's algorithm preforms badly (something like O(N * M) in time). Thanks in advance.

Теги flows, maximum matching, kuhn

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский radoslav11 2017-07-16 15:58:36 257 Initial revision (published)