Search results

• Maximum-weight matching
  == Known algorithms ==
  2 KB (264 words) - 17:37, 6 December 2014
• Sorting Algorithms
  == Important algorithms ==
  2 KB (230 words) - 14:21, 12 November 2014
• Cardinality-maximal matching
  == Known algorithms: ==
  2 KB (305 words) - 09:51, 6 December 2014
• Min-cost flow problem
  == Known Algorithms ==
  2 KB (348 words) - 14:31, 1 December 2014
• Eulerian cycle
  == Known algorithms ==
  2 KB (307 words) - 20:57, 12 November 2014
• Asymptotic complexity of algorithms
  ...ghly speaking, the run time of an algorithm is measured by the number of [[Algorithms and correctness#Instructions, operations and subroutines|operations]] execu For the inputs of an [[Algorithms and correctness#Algorithmic problem|algorithmic problem]], one or more (num
  4 KB (700 words) - 05:54, 25 April 2016
• Max-Flow Problems
  == Known algorithms ==
  4 KB (786 words) - 08:58, 31 March 2018
• Model computer
  ...tc., are ignored here. These details are not necessary for the analysis of algorithms and data structures. All descriptions of algorithms and data structures and algorithmic problems in this wiki shall be based on
  3 KB (401 words) - 14:28, 13 January 2015
• Basics of shortest paths
  ...<math>s</math> to <math>v</math> on termination. In virtually all standard algorithms, the following update operation is the (only) operation to update <math>d</ As said [[#Valid distance property|here]], all common algorithms for shortest-paths problems apply a standard update operation. This operati
  11 KB (2,059 words) - 14:34, 5 December 2014
• Binary search tree: traverse
  [[Category:Algorithms]] [[Category:Search Algorithms]]
  6 KB (959 words) - 13:41, 3 March 2017
• Breadth-first search
  [[Category:Algorithms]] [[Category:Search Algorithms]]
  7 KB (1,165 words) - 07:50, 26 October 2015
• Array list: find
  ...Kappa</math> for some <math>j \in \{1, \ldots, p.n\}</math>, terminate the algorithms and return '''true'''.
  2 KB (262 words) - 23:10, 19 June 2015
• Selection sort
  [[Category:Sorting Algorithms]]
  2 KB (327 words) - 11:05, 30 June 2015
• Hopcroft-Tarjan
  [[Category:Graph Algorithms]] ...another example where it makes perfect sense to implement graph traversal algorithms as iterators (cf. [[Graph traversal#Remarks|here]]). In fact, then the oper
  6 KB (1,028 words) - 13:31, 3 November 2015
• Successive shortest paths
  ...orks on a nonnegative variation of the cost values, which allows efficient algorithms.
  6 KB (1,107 words) - 10:08, 6 May 2015
• Algorithms and correctness
  == Iterative and recursive algorithms == ...thus executed strictly after each other), it may be viewed as two or more algorithms that are executed after each other. Therefore, without loss of generality,
  12 KB (1,782 words) - 12:49, 28 April 2016
• Bubblesort
  [[Category:Sorting Algorithms]]
  3 KB (453 words) - 12:17, 18 September 2015
• Depth-first search
  [[Category:Algorithms]] [[Category:Search Algorithms]]
  11 KB (1,966 words) - 06:52, 26 October 2015
• Dinic
  # Use one of the algorithms for the [[Blocking flow|blocking flow]] problem to construct a blocking flo
  2 KB (334 words) - 10:43, 8 January 2015
• Kosaraju
  [[Category:Graph Algorithms]]
  4 KB (789 words) - 07:37, 2 November 2015

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