Oldest pages

Jump to navigation Jump to search

Showing below up to 20 results in range #51 to #70.

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)

  1. Cardinality-maximal matching‏‎ (09:51, 6 December 2014)
  2. Hopcroft-Karp‏‎ (15:00, 6 December 2014)
  3. Maximum-weight matching‏‎ (17:37, 6 December 2014)
  4. Max-flow min-cut‏‎ (09:29, 3 January 2015)
  5. Dinic‏‎ (10:43, 8 January 2015)
  6. Model computer‏‎ (14:28, 13 January 2015)
  7. Alternating paths algorithm‏‎ (13:38, 27 January 2015)
  8. Negative cycle-canceling‏‎ (15:18, 5 February 2015)
  9. Successive shortest paths with reduced costs‏‎ (14:39, 20 February 2015)
  10. Classical bipartite cardinality matching‏‎ (08:49, 22 February 2015)
  11. Maximum matching by Edmonds‏‎ (09:25, 22 February 2015)
  12. Matchings in graphs‏‎ (09:53, 22 February 2015)
  13. Dial implementation‏‎ (09:57, 26 February 2015)
  14. Hungarian method‏‎ (17:26, 27 February 2015)
  15. One-dimensional string matching‏‎ (09:22, 29 April 2015)
  16. Pivot partioning‏‎ (13:34, 5 May 2015)
  17. Successive shortest paths‏‎ (10:08, 6 May 2015)
  18. Basic graph definitions‏‎ (14:47, 16 May 2015)
  19. Sorting Sequences of Strings‏‎ (11:38, 17 May 2015)
  20. Strings‏‎ (11:39, 17 May 2015)

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)