Oldest pages

Jump to navigation Jump to search

Showing below up to 50 results in range #51 to #100.

View (previous 50 | next 50) (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)
  21. Sorting based on pairwise comparison‏‎ (12:30, 17 May 2015)
  22. Merging two sorted sequences‏‎ (09:22, 20 May 2015)
  23. Sets and sequences‏‎ (12:24, 21 May 2015)
  24. Genericity‏‎ (12:45, 21 May 2015)
  25. Ordered sequence‏‎ (12:52, 21 May 2015)
  26. Sorted sequence‏‎ (13:06, 21 May 2015)
  27. Directed Tree‏‎ (11:29, 26 May 2015)
  28. B-tree‏‎ (13:49, 26 May 2015)
  29. Pivot partitioning by scanning‏‎ (08:30, 30 May 2015)
  30. Numbers‏‎ (18:09, 9 June 2015)
  31. Minimum spanning tree‏‎ (12:33, 16 June 2015)
  32. Path‏‎ (00:26, 17 June 2015)
  33. Linked list‏‎ (22:49, 19 June 2015)
  34. Bubble sort‏‎ (22:50, 19 June 2015)
  35. Bellman-Ford‏‎ (22:51, 19 June 2015)
  36. Bucketsort‏‎ (22:51, 19 June 2015)
  37. Doubly-linked list‏‎ (23:08, 19 June 2015)
  38. Array list: find‏‎ (23:10, 19 June 2015)
  39. Array list: number‏‎ (23:10, 19 June 2015)
  40. Array list: remove‏‎ (23:11, 19 June 2015)
  41. Heap as array‏‎ (23:12, 19 June 2015)
  42. Heap as array: ascendItem‏‎ (23:12, 19 June 2015)
  43. Heap as array: decrease key‏‎ (23:12, 19 June 2015)
  44. Heap as array: descendItem‏‎ (23:12, 19 June 2015)
  45. Heap as array: extract minimum‏‎ (23:13, 19 June 2015)
  46. Heap as array: insert‏‎ (23:13, 19 June 2015)
  47. Quicksort in Place‏‎ (23:16, 19 June 2015)
  48. B-tree: shift key to sibling‏‎ (23:17, 19 June 2015)
  49. B-tree: merge two siblings‏‎ (23:19, 19 June 2015)
  50. B-tree: insert and rearrange‏‎ (23:19, 19 June 2015)

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

Retrieved from "https://wiki.algo.informatik.tu-darmstadt.de/Special:AncientPages"