Search results

• Merge
  '''Algorithmic problem:''' [[Merging two sorted sequences]]
  2 KB (290 words) - 12:14, 18 September 2015
• Shortest paths by repeated squaring
  '''Algorithmic problem:''' [[All pairs shortest paths]]
  2 KB (318 words) - 19:50, 6 October 2014
• Negative cycle-canceling
  '''Algorithmic problem:''' [[Min-cost flow problem]] ...oblem to find a feasible flow is reduced to a [[Max-Flow Problems|max-flow problem]] as follows:
  7 KB (1,256 words) - 15:18, 5 February 2015
• Successive shortest paths with reduced costs
  '''Algorithmic problem:''' [[Min-cost flow problem]]
  4 KB (757 words) - 14:39, 20 February 2015
• Bellman-Ford
  '''Algorithmic problem:''' [[All pairs shortest paths]]
  2 KB (393 words) - 22:51, 19 June 2015
• Bubblesort
  '''Algorithmic problem:''' [[Sorting based on pairwise comparison]]
  3 KB (453 words) - 12:17, 18 September 2015
• Binary search tree: remove node
  '''Algorithmic problem:''' See the [[Binary Search Tree#Remark|remark clause]] of [[Binary Search
  3 KB (454 words) - 13:39, 3 March 2017
• Binary search tree: find
  '''Algorithmic Problem:''' [[Sorted sequence#Find|Sorted Sequence:find]]
  3 KB (425 words) - 13:38, 3 March 2017
• Heap as array: decrease key
  '''Algorithmic problem:''' [[Bounded priority queue|Bounded priority queue: decrease key]]
  2 KB (369 words) - 23:12, 19 June 2015
• Bubble sort
  '''Algorithmic problem:''' [[Sorting based on pairwise comparison]]
  2 KB (414 words) - 22:50, 19 June 2015
• Heap as array: extract minimum
  '''Algorithmic problem:''' [[Bounded priority queue|Bounded priority queue: extract minimum]]
  3 KB (438 words) - 23:13, 19 June 2015
• Floyd-Warshall
  '''Algorithmic problem:''' [[All pairs shortest paths]]
  3 KB (510 words) - 09:28, 24 May 2022
• Ford-Fulkerson
  '''Algorithmic problem:''' [[Max-Flow Problems#Standard version|Max-flow problems (standard versio
  3 KB (425 words) - 11:49, 23 June 2015
• Kruskal for maximum spanning forest
  #[07:29] Welches Problem löst der Algorithmus von Kruskal genau? '''Algorithmic problem:''' [[Maximum spanning forest]]
  5 KB (812 words) - 18:31, 20 September 2015
• Heap as array: insert
  '''Algorithmic problem:''' [[Bounded priority queue|Bounded priority queue: insert]]
  3 KB (477 words) - 23:13, 19 June 2015
• Blocking flow by Dinic
  '''Algorithmic problem:''' [[Blocking flow]].
  3 KB (479 words) - 08:37, 7 December 2015
• B-tree: find
  '''Algorithmic problem:''' [[Sorted sequence#Find|Sorted sequence: find]]
  3 KB (528 words) - 13:46, 3 March 2017
• Array list: remove
  '''Algorithmic problem:''' [[Ordered sequence#Remove|Ordered sequence: remove]]
  5 KB (808 words) - 23:11, 19 June 2015
• Heap as array: ascendItem
  '''Algorithmic problem:''' [[Heap as array|Heap as array: ascendItem]]
  3 KB (584 words) - 23:12, 19 June 2015
• Preflow-push with excess scaling
  '''Algorithmic problem:''' [[Max-Flow Problems#Standard version|max-flow problem (standard version)]]
  5 KB (916 words) - 17:29, 18 December 2017

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