Search results

• Bucketsort
  '''Algorithmic problem:''' [[Sorting Sequences of Strings]]
  4 KB (744 words) - 22:51, 19 June 2015
• Classical eulerian cycle algorithm
  '''Algorithmic problem:''' [[Eulerian cycle]]
  4 KB (673 words) - 08:15, 2 November 2015
• Maximum matching by Edmonds
  '''Algorithmic problem:'''
  4 KB (671 words) - 09:25, 22 February 2015
• Mergesort
  '''Algorithmic problem:''' [[Sorting based on pairwise comparison]]
  4 KB (617 words) - 13:36, 3 March 2017
• Edmonds-Karp
  '''Algorithmic problem:''' [[Max-Flow Problems#Standard version|Max-flow problems (standard versio
  4 KB (790 words) - 12:34, 1 December 2015
• Pivot partitioning by scanning
  '''Algorithmic problem:''' [[Pivot partioning]]
  7 KB (1,075 words) - 08:30, 30 May 2015
• Three indians' algorithm
  '''Algorithmic problem:''' [[Blocking flow]].
  4 KB (788 words) - 11:27, 16 March 2017
• Prim
  '''Algorithmic problem:''' [[Minimum spanning tree]]
  5 KB (901 words) - 09:28, 21 June 2015
• Preflow-push
  '''Algorithmic problem:''' [[Max-Flow Problems#Standard version|max-flow problem (standard version)]]
  9 KB (1,560 words) - 03:53, 20 June 2017
• Hopcroft-Tarjan
  '''Algorithmic problem:'''
  6 KB (1,028 words) - 13:31, 3 November 2015
• String matching based on finite automaton
  '''Algorithmic problem:''' [[One-dimensional string matching]]
  6 KB (1,053 words) - 14:36, 16 September 2015
• Binary search tree: traverse
  '''Algorithmic problem:''' [[Sorted sequence#Traverse|Sorted sequence: traverse]]
  6 KB (959 words) - 13:41, 3 March 2017
• Hungarian method
  '''Algorithmic problem:''' [[Maximum-weight matching]] in [[Basic graph definitions#Complete graph
  6 KB (1,033 words) - 17:26, 27 February 2015
• Hopcroft-Karp
  '''Algorithmic problem:'''
  6 KB (1,029 words) - 15:00, 6 December 2014
• Breadth-first search
  '''Algorithmic problem:''' [[Graph traversal]]
  7 KB (1,165 words) - 07:50, 26 October 2015
• Branching by Edmonds
  '''Algorithmic problem:''' [[Maximum branching]]
  7 KB (1,243 words) - 07:59, 8 November 2015
• Classical bipartite cardinality matching
  '''Algorithmic problem:'''
  7 KB (1,284 words) - 08:49, 22 February 2015
• B-tree: insert
  '''Algorithmic problem:''' [[Sorted sequence#Insert|Sorted sequence: insert]]
  7 KB (1,135 words) - 13:47, 3 March 2017
• Ahuja-Orlin
  '''Algorithmic problem:''' [[Max-Flow Problems#Standard version|Max-flow problems (standard versio
  8 KB (1,416 words) - 07:59, 30 November 2015
• Quicksort
  '''Algorithmic problem:''' [[Sorting based on pairwise comparison]]
  9 KB (1,575 words) - 13:36, 3 March 2017
• B-tree: remove
  '''Algorithmic problem:''' [[Sorted sequence#Remove|Sorted sequence: remove]]
  10 KB (1,690 words) - 13:58, 3 March 2017
• Depth-first search
  '''Algorithmic problem:''' [[Graph traversal]]
  11 KB (1,966 words) - 06:52, 26 October 2015
• Dijkstra
  '''Algorithmic problem:''' [[Single source shortest paths]]
  10 KB (1,765 words) - 08:35, 14 January 2021

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