Search results

Page title matches

• Three indians' algorithm
  '''Type of algorithm:''' loop. # The algorithm is named after three indian researchers, V. M. Malhotra, M. Pramodh Kumar,
  4 KB (788 words) - 11:27, 16 March 2017
• Alternating paths algorithm
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  1 KB (190 words) - 13:38, 27 January 2015
• Simple string matching algorithm
  [[Category:Algorithm]] [[Category:Main Algorithm]]
  4 KB (707 words) - 10:13, 21 September 2015
• Classical eulerian cycle algorithm
  ''' Type of algorithm:''' recursion with an arbitrarily chosen start node <math>s\in V</math> as # If <math>x\neq s</math>, terminate the algorithm with the statement that no eulerian cycle exists.
  4 KB (673 words) - 08:15, 2 November 2015

Page text matches

• B-tree: minimum
  '''Type of algorithm:''' loop ==Description of the algorithm==
  735 bytes (107 words) - 11:22, 13 October 2014
• Alternating paths algorithm
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  1 KB (190 words) - 13:38, 27 January 2015
• B-tree: maximum
  '''Type of algorithm:''' loop == Description of the algorithm ==
  835 bytes (136 words) - 11:21, 13 October 2014
• Asymptotic complexity of algorithms
  # Roughly speaking, the run time of an algorithm is measured by the number of [[Algorithms and correctness#Instructions, ope ...arded. For that, it does not matter how fast the machine and how smart the algorithm's implementation is.
  4 KB (700 words) - 05:54, 25 April 2016
• Merge
  [[Category:Algorithm]] [[Category:Auxiliary Algorithm]]
  2 KB (290 words) - 12:14, 18 September 2015
• Array list: remove
  '''Type of algorithm:''' loop ...ise, if the key to be removed is in the first array, it is removed and the algorithm terminates again (if this was the only element of the array, that array lis
  5 KB (808 words) - 23:11, 19 June 2015
• Bellman-Ford
  [[Category:Algorithm]] [[Category:Main Algorithm]]
  2 KB (393 words) - 22:51, 19 June 2015
• Bubble
  [[Category:Algorithm]] [[Category:Auxiliary Algorithm]]
  1 KB (257 words) - 15:01, 11 October 2014
• Heap as array: decrease key
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  2 KB (369 words) - 23:12, 19 June 2015
• Heap as array: extract minimum
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  3 KB (438 words) - 23:13, 19 June 2015
• Array list: find
  '''Type of algorithm:''' loop # Terminate the algorithm if the end of the list is reached or, otherwise, if <math>\Kappa</math> is
  2 KB (262 words) - 23:10, 19 June 2015
• Binary search tree: remove
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  5 KB (762 words) - 13:39, 3 March 2017
• B-tree: find
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  3 KB (528 words) - 13:46, 3 March 2017
• Binary search tree: remove node
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  3 KB (454 words) - 13:39, 3 March 2017
• Dinic
  '''Type of algorithm :''' loop. Feasibility of <math>f</math> follows immediately from the invariant. If the algorithm terminates, the break condition immediately proves maximality along with th
  2 KB (334 words) - 10:43, 8 January 2015
• Binary search tree: find
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  3 KB (425 words) - 13:38, 3 March 2017
• Heap as array: insert
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  3 KB (477 words) - 23:13, 19 June 2015
• Binary search tree: insert
  '''Type of algorithm:''' loop ...o next is void, insert <math>K</math> in that empty slot and terminate the algorithm. Otherwise, proceed in that direction.
  4 KB (716 words) - 13:39, 3 March 2017
• Successive shortest paths with reduced costs
  '''Type of algorithm:''' loop ...e invariant of the [[Successive shortest paths|successive shortest paths]] algorithm.
  4 KB (757 words) - 14:39, 20 February 2015
• Eulerian cycle
  ...o see (and follows from the [[Classical eulerian cycle algorithm|classical algorithm]]) that a graph <math>G</math> is eulerian if, and only if: [[Classical eulerian cycle algorithm]]
  2 KB (307 words) - 20:57, 12 November 2014
• Graph traversal
  # It may be reasonable to implement a graph traversal algorithm in the form of an iterator, which returns the processed nodes and/or the tr # [[Dijkstra|Dijkstra's algorithm]] may be implemented as a graph traversal that returns the nodes in the ord
  2 KB (314 words) - 19:06, 9 November 2014
• Heap as array: ascendItem
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  3 KB (584 words) - 23:12, 19 June 2015
• Heap as array: descendItem
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  4 KB (635 words) - 23:12, 19 June 2015
• Preflow-push with excess scaling
  ...ization and slight modification of the [[Preflow-push|generic preflow-push algorithm]]: ...the residual capacity of <math>(v,w)</math> as in the generic preflow-push algorithm; here it is the minimum of these two values ''and'' a third value, <math>\D
  5 KB (916 words) - 17:29, 18 December 2017
• Repeated depth-first search
  '''Type of algorithm:''' loop ...-first search|DFS]] with one modification: Instead of an arborescence, the algorithm returns a [[Basic graph definitions#Forests, trees, branchings, arborescenc
  2 KB (294 words) - 07:28, 3 November 2014
• Array list: number
  '''Type of algorithm:''' loop # If <math>p=</math>void, terminate the algorithm and return the value of <math>c</math>.
  2 KB (265 words) - 23:10, 19 June 2015
• Genericity
  ...ft open in the definition. The choice of these types is deferred until the algorithm is called or an object of the data structure is created.
  2 KB (290 words) - 12:45, 21 May 2015
• Shortest paths by repeated squaring
  '''Type of algorithm:''' loop ...eventual contents of <math>M</math> will be returned as the result of the algorithm.
  2 KB (318 words) - 19:50, 6 October 2014
• B-tree: merge two siblings
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  4 KB (724 words) - 23:19, 19 June 2015
• Algorithms and correctness
  == Algorithm == # An algorithm is associated with an [[#Algorithmic problem|algorithmic problem]].
  12 KB (1,782 words) - 12:49, 28 April 2016
• Classical eulerian cycle algorithm
  ''' Type of algorithm:''' recursion with an arbitrarily chosen start node <math>s\in V</math> as # If <math>x\neq s</math>, terminate the algorithm with the statement that no eulerian cycle exists.
  4 KB (673 words) - 08:15, 2 November 2015
• Maximum matching by Edmonds
  '''Type of algorithm:''' recursion. ...aph search]] from the [[Classical bipartite cardinality matching|classical algorithm]] for the restriction to [[Basic graph definitions#Bipartite and k-partite
  4 KB (671 words) - 09:25, 22 February 2015
• Lecture: Efficient Graph Algorithms
  File:V15 Hungarian Algorithm 1.jpg|Hungarian Algorithm 1 File:V15 Hungarian Algorithm 2.jpg|Hungarian Algorithm 2
  5 KB (732 words) - 09:07, 13 February 2016
• B-tree: remove
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  10 KB (1,690 words) - 13:58, 3 March 2017
• Simple string matching algorithm
  [[Category:Algorithm]] [[Category:Main Algorithm]]
  4 KB (707 words) - 10:13, 21 September 2015
• FIFO preflow-push
  This is a specialization of the [[Preflow-push|generic preflow-push algorithm]]: ...ty|complexity considerations]] for the [[Preflow-push|generic preflow-push algorithm]] yield <math>\mathcal{O}(n^2)</math> relabel operations and forward steps
  3 KB (443 words) - 09:20, 14 December 2015
• B-tree: insert and rearrange
  [[Category:Algorithm]] '''Type of algorithm:''' Text
  4 KB (689 words) - 23:19, 19 June 2015
• Successive shortest paths
  '''Type of algorithm:''' loop # If there is none, terminate the algorithm.
  6 KB (1,107 words) - 10:08, 6 May 2015
• One-dimensional string matching
  # [[Simple string matching algorithm]]
  725 bytes (110 words) - 09:22, 29 April 2015
• Preflow-push
  '''Also known as:''' ''push-relabel'' algorithm or ''Goldberg-Tarjan'' algorithm '''Type of algorithm:'''
  9 KB (1,560 words) - 03:53, 20 June 2017
• B-tree: insert
  [[Category: Algorithm]] '''Type of algorithm:''' loop
  7 KB (1,135 words) - 13:47, 3 March 2017
• Blocking flow by Dinic
  '''Type of algorithm:''' loop. # If <math>t</math> is ''not'' seen, the break condition applies, and the algorithm is terminated.
  3 KB (479 words) - 08:37, 7 December 2015
• Pivot partitioning by scanning
  '''Type of algorithm:''' loop # If the algorithm is not done yet, identify two out of the three index pointers <math>i_1,i_2
  7 KB (1,075 words) - 08:30, 30 May 2015
• Three indians' algorithm
  '''Type of algorithm:''' loop. # The algorithm is named after three indian researchers, V. M. Malhotra, M. Pramodh Kumar,
  4 KB (788 words) - 11:27, 16 March 2017
• Negative cycle-canceling
  '''Type of algorithm:''' loop ...</math> is <math>-c(v,w)</math> in case <math>(w,v)\in A_f</math>. Let the algorithm [[Basics of shortest paths#Constructing a shortest-paths arborescence or a
  7 KB (1,256 words) - 15:18, 5 February 2015
• Array list: insert at position
  '''Type of algorithm:''' loop # If <math>p=</math> void, terminate the algorithm and return '''false'''.
  4 KB (628 words) - 12:57, 18 September 2015
• Ahuja-Orlin
  '''Type of algorithm:''' loop It remains to show that the algorithm indeed terminates. This is proved by the following complexity consideration
  8 KB (1,416 words) - 07:59, 30 November 2015
• Main Page
  * [[Simple string matching algorithm]] (DONE) * [[Alternating paths algorithm]]
  4 KB (380 words) - 15:13, 30 November 2020
• B-tree: shift key to sibling
  [[Category:Algorithm]] '''Type of algorithm:''' loop
  4 KB (708 words) - 23:17, 19 June 2015
• String matching based on finite automaton
  [[Category:Algorithm]] [[Category:Main Algorithm]]
  6 KB (1,053 words) - 14:36, 16 September 2015
• String matching
  [[Simple string matching algorithm]]
  1 KB (179 words) - 19:30, 1 October 2014
• Quicksort
  '''Type of algorithm:''' recursion ...ion of all three lists, <math>S_1 + S_2 + S_3</math>, is the result of the algorithm.
  9 KB (1,575 words) - 13:36, 3 March 2017
• Blocking flow
  # [[Three indians' algorithm]]
  1 KB (189 words) - 19:06, 9 November 2014
• Binary search tree: traverse
  '''Type of algorithm:''' loop ## If <math>S</math> is empty, terminate the algorithm.
  6 KB (959 words) - 13:41, 3 March 2017
• Branching by Edmonds
  '''Type of algorithm:''' recursion # Call the algorithm recursively for the modified weighted graph after shrinking, giving branchi
  7 KB (1,243 words) - 07:59, 8 November 2015
• Bucketsort
  '''Type of algorithm:''' loop ...S'</math> of strings, which will eventually hold the overall result of the algorithm.
  4 KB (744 words) - 22:51, 19 June 2015
• Dijkstra
  ...e "frontierline" of the algorithm. We choose another variant on Dijkstra's algorithm mainly for simplicity of presentation. ...math>\delta(t) = \Delta(t)</math> from then on. This variant on Dijkstra's algorithm is sometimes called the '''early termination variant'''.[[File:Dijkstrabidi
  10 KB (1,765 words) - 08:35, 14 January 2021
• Mergesort
  '''Type of algorithm:''' recursion ...ively using Mergesort. The sorted subsequences are "merged" into one using algorithm [[Merge]].
  4 KB (617 words) - 13:36, 3 March 2017
• Binary search
  '''Type of algorithm:''' recursion
  2 KB (298 words) - 06:29, 27 April 2016
• Selection sort
  '''Type of algorithm:''' loop
  2 KB (327 words) - 11:05, 30 June 2015
• Depth-first search
  '''Type of algorithm:''' loop It is easy to see that each operation of the algorithm is well defined. Due to the variant, the loop terminates after a finite num
  11 KB (1,966 words) - 06:52, 26 October 2015
• Prim
  '''Type of algorithm:''' loop ...ode joins <math>V_i</math>, its key will be irrelevant for the rest of the algorithm.
  5 KB (901 words) - 09:28, 21 June 2015
• Hopcroft-Tarjan
  '''Type of algorithm:''' # The core algorithm is a variation of [[Depth-first search|DFS]], where for each node <math>v\i
  6 KB (1,028 words) - 13:31, 3 November 2015
• Hopcroft-Karp
  '''Type of algorithm:''' loop. ...s at termination is called a '''Hungarian forest''' in the literature. The algorithm proves, constructively, that a matching in a bipartite graph is cardinality
  6 KB (1,029 words) - 15:00, 6 December 2014
• Basics of shortest paths
  Consider an algorithm that yields a shortest <math>(s,v)</math>-path for each node <math>v\in V</ The algorithm will yield <math>d(s)<0</math> if, and only if, <math>s</math> is on some n
  11 KB (2,059 words) - 14:34, 5 December 2014
• Breadth-first search
  '''Type of algorithm:''' loop It is easy to see that each operation of the algorithm is well defined. Due to the variant, the loop terminates after a finite num
  7 KB (1,165 words) - 07:50, 26 October 2015
• Bubblesort
  '''Type of algorithm:''' loop
  3 KB (453 words) - 12:17, 18 September 2015
• Bubble sort
  '''Type of algorithm:''' loop
  2 KB (414 words) - 22:50, 19 June 2015
• Floyd-Warshall
  '''Type of algorithm:''' loop
  3 KB (510 words) - 09:28, 24 May 2022
• Classical bipartite cardinality matching
  '''Type of algorithm:''' loop. This algorithm may be interpreted as an application of [[Ford-Fulkerson]]:
  7 KB (1,284 words) - 08:49, 22 February 2015
• Ford-Fulkerson
  '''Type of algorithm:''' loop<br>
  3 KB (425 words) - 11:49, 23 June 2015
• Kosaraju
  '''Type of algorithm:''' loop
  4 KB (789 words) - 07:37, 2 November 2015
• Edmonds-Karp
  '''Algorithm :''' This is a specialization of [[Ford-Fulkerson]]: Among all [[Basic flow
  4 KB (790 words) - 12:34, 1 December 2015
• Kruskal for maximum spanning forest
  '''Type of algorithm:''' loop
  5 KB (812 words) - 18:31, 20 September 2015
• Hungarian method
  '''Type of algorithm:''' loop.
  6 KB (1,033 words) - 17:26, 27 February 2015
• Basic flow definitions
  ...ation and discussion of the individual algorithms. An implementation of an algorithm may be based on <math>(G,f)</math> or on <math>(G_f,u_f)</math> or even on
  11 KB (2,126 words) - 13:42, 17 November 2015
• Basic graph definitions
  ...y algorithmic problems on graphs, isolated nodes may be removed before the algorithm commences.
  15 KB (2,712 words) - 14:47, 16 May 2015