Search results

Sorting Sequences of Strings
[[Category:Algorithmic Problem]] ...esort]] (solves the [[Sorting based on pairwise comparison|generic sorting problem]])

1,021 bytes (134 words) - 11:38, 17 May 2015
Asymptotic complexity of algorithms
...inputs of an [[Algorithms and correctness#Algorithmic problem|algorithmic problem]], one or more (numerical) '''characterizing parameters''' are to be select ...n_k)</math> denote the set of all [[Algorithms and correctness#Algorithmic problem|instances]] for which these parameters assume the values <math>n_1,\ldots,n

4 KB (700 words) - 05:54, 25 April 2016
Find an element in a sequence
[[Category:Algorithmic Problem]]

495 bytes (68 words) - 19:53, 1 October 2014
Alternating paths algorithm
[[Category:Maximum matching problem]] '''Algorithmic Problem:''' [[Matchings in graphs]].

1 KB (190 words) - 13:38, 27 January 2015
String matching
[[Category:Algorithmic Problem]] ...ath>T</math> in <math>S</math> may overlap (otherwise, the string matching problem would be trivially solvable in linear time).

1 KB (179 words) - 19:30, 1 October 2014
Merging two sorted sequences
[[Category:Algorithmic Problem]]

656 bytes (93 words) - 09:22, 20 May 2015
One-dimensional string matching
[[Category:Algorithmic Problem]]

725 bytes (110 words) - 09:22, 29 April 2015
B-tree: minimum
'''Algorithmic Problem:'''

735 bytes (107 words) - 11:22, 13 October 2014
Dinic
'''Algorithmic problem:''' [[Max-Flow Problems#Standard version|Max-flow problem (standard version)]] # Use one of the algorithms for the [[Blocking flow|blocking flow]] problem to construct a blocking flow <math>f'</math> in <math>G'</math> with respec

2 KB (334 words) - 10:43, 8 January 2015
B-tree: maximum
'''Algorithmic Problem:'''

835 bytes (136 words) - 11:21, 13 October 2014
Median
[[Category:Algorithmic Problem]]

1 KB (201 words) - 12:16, 2 October 2014
Sorting based on pairwise comparison
[[Category:Algorithmic Problem]]

1 KB (201 words) - 12:30, 17 May 2015
Bubble
'''Algorithmic problem:''' Moving the maximum element

1 KB (257 words) - 15:01, 11 October 2014
Binary search
'''Algorithmic problem:''' [[Finding an element in a sorted array]]

2 KB (298 words) - 06:29, 27 April 2016
Algorithms and correctness
== Algorithmic problem == An algorithmic problem is described by:

12 KB (1,782 words) - 12:49, 28 April 2016
Repeated depth-first search
'''Algorithmic problem:''' [[Exhaustive graph traversal]]

2 KB (294 words) - 07:28, 3 November 2014
Array list: find
'''Algorithmic problem:''' [[Ordered sequence#Find|Ordered sequence: find]]

2 KB (262 words) - 23:10, 19 June 2015
Array list: number
'''Algorithmic problem:''' [[Ordered sequence#Number|Ordered sequence: number]]

2 KB (265 words) - 23:10, 19 June 2015
Selection sort
'''Algorithmic problem:''' [[Sorting based on pairwise comparison]]

2 KB (327 words) - 11:05, 30 June 2015
Genericity
An algorithmic problem, algorithm, abstract data structure, or implementation of a data structure

2 KB (290 words) - 12:45, 21 May 2015
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
Binary search tree: insert
'''Algorithmic problem:''' [[Sorted sequence#Insert|Sorted sequence: insert]]

4 KB (716 words) - 13:39, 3 March 2017
Array list: insert at position
'''Algorithmic problem:''' [[Ordered sequence#Insert at position|Ordered sequence: insert at posit

4 KB (628 words) - 12:57, 18 September 2015
B-tree: shift key to sibling
'''Algorithmic problem:''' [[B-Trees|See B-Trees]]

4 KB (708 words) - 23:17, 19 June 2015
Successive shortest paths
'''Algorithmic problem:''' [[Min-cost flow problem]]

6 KB (1,107 words) - 10:08, 6 May 2015
Binary search tree: remove
'''Algorithmic Problem:''' [[Sorted sequence#Remove|Sorted sequence:remove]]

5 KB (762 words) - 13:39, 3 March 2017
Simple string matching algorithm
'''Algorithmic problem:''' [[One-dimensional string matching]]

4 KB (707 words) - 10:13, 21 September 2015
Heap as array: descendItem
'''Algorithmic problem:''' [[Heap as array|Heap as array: descendItem]]

4 KB (635 words) - 23:12, 19 June 2015
B-tree: insert and rearrange
'''Algorithmic problem:''' [[Text here]]

4 KB (689 words) - 23:19, 19 June 2015
B-tree: merge two siblings
'''Algorithmic problem:''' See [[B-Trees]]

4 KB (724 words) - 23:19, 19 June 2015
Kosaraju
'''Algorithmic problem:''' [[Strongly connected components]]

4 KB (789 words) - 07:37, 2 November 2015

Search results

Navigation menu

Search