Oldest pages

Jump to navigation Jump to search

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

View (previous 100 | next 100) (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)
  51. Union-find‏‎ (13:58, 20 June 2015)
  52. Union-find with lists‏‎ (14:27, 20 June 2015)
  53. Prim‏‎ (09:28, 21 June 2015)
  54. Ford-Fulkerson‏‎ (11:49, 23 June 2015)
  55. Selection sort‏‎ (11:05, 30 June 2015)
  56. Binary search tree‏‎ (06:14, 6 July 2015)
  57. String matching based on finite automaton‏‎ (14:36, 16 September 2015)
  58. Merge‏‎ (12:14, 18 September 2015)
  59. Bubblesort‏‎ (12:17, 18 September 2015)
  60. Array list: insert at position‏‎ (12:57, 18 September 2015)
  61. Maximum spanning forest‏‎ (18:03, 18 September 2015)
  62. Kruskal for maximum spanning forest‏‎ (18:31, 20 September 2015)
  63. Array list‏‎ (09:59, 21 September 2015)
  64. Simple string matching algorithm‏‎ (10:13, 21 September 2015)
  65. Bounded priority queue‏‎ (06:43, 19 October 2015)
  66. Depth-first search‏‎ (06:52, 26 October 2015)
  67. Breadth-first search‏‎ (07:50, 26 October 2015)
  68. Kosaraju‏‎ (07:37, 2 November 2015)
  69. Classical eulerian cycle algorithm‏‎ (08:15, 2 November 2015)
  70. Hopcroft-Tarjan‏‎ (13:31, 3 November 2015)
  71. Maximum branching‏‎ (07:53, 8 November 2015)
  72. Branching by Edmonds‏‎ (07:59, 8 November 2015)
  73. Basic flow definitions‏‎ (13:42, 17 November 2015)
  74. Ahuja-Orlin‏‎ (07:59, 30 November 2015)
  75. Edmonds-Karp‏‎ (12:34, 1 December 2015)
  76. Blocking flow by Dinic‏‎ (08:37, 7 December 2015)
  77. FIFO preflow-push‏‎ (09:20, 14 December 2015)
  78. Lecture: Efficient Graph Algorithms‏‎ (09:07, 13 February 2016)
  79. Asymptotic complexity of algorithms‏‎ (05:54, 25 April 2016)
  80. Finding an element in a sorted array‏‎ (05:52, 27 April 2016)
  81. Binary search‏‎ (06:29, 27 April 2016)
  82. Algorithms and correctness‏‎ (12:49, 28 April 2016)
  83. Asymptotic comparison of functions‏‎ (15:38, 10 May 2016)
  84. Quicksort‏‎ (13:36, 3 March 2017)
  85. Mergesort‏‎ (13:36, 3 March 2017)
  86. Binary search tree: find‏‎ (13:38, 3 March 2017)
  87. Binary search tree: insert‏‎ (13:39, 3 March 2017)
  88. Binary search tree: remove‏‎ (13:39, 3 March 2017)
  89. Binary search tree: remove node‏‎ (13:39, 3 March 2017)
  90. Binary search tree: traverse‏‎ (13:41, 3 March 2017)
  91. B-tree: find‏‎ (13:46, 3 March 2017)
  92. B-tree: insert‏‎ (13:47, 3 March 2017)
  93. B-tree: remove‏‎ (13:58, 3 March 2017)
  94. Three indians' algorithm‏‎ (11:27, 16 March 2017)
  95. Preflow-push‏‎ (03:53, 20 June 2017)
  96. Preflow-push with excess scaling‏‎ (17:29, 18 December 2017)
  97. Max-Flow Problems‏‎ (08:58, 31 March 2018)
  98. Main Page‏‎ (15:13, 30 November 2020)
  99. Dijkstra‏‎ (08:35, 14 January 2021)
  100. Floyd-Warshall‏‎ (09:28, 24 May 2022)

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

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