Search results

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

...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

[[Category:Algorithmic Problem]]

[[Category:Maximum matching problem]] '''Algorithmic Problem:''' [[Matchings in graphs]].

[[Category:Algorithmic Problem]] ...ath>T</math> in <math>S</math> may overlap (otherwise, the string matching problem would be trivially solvable in linear time).

[[Category:Algorithmic Problem]]

[[Category:Algorithmic Problem]]

'''Algorithmic Problem:'''

'''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

'''Algorithmic Problem:'''

[[Category:Algorithmic Problem]]

[[Category:Algorithmic Problem]]

'''Algorithmic problem:''' Moving the maximum element

'''Algorithmic problem:''' [[Finding an element in a sorted array]]

== Algorithmic problem == An algorithmic problem is described by:

'''Algorithmic problem:''' [[Exhaustive graph traversal]]

'''Algorithmic problem:''' [[Ordered sequence#Find|Ordered sequence: find]]

'''Algorithmic problem:''' [[Ordered sequence#Number|Ordered sequence: number]]

'''Algorithmic problem:''' [[Sorting based on pairwise comparison]]

An algorithmic problem, algorithm, abstract data structure, or implementation of a data structure

'''Algorithmic problem:''' [[Merging two sorted sequences]]

'''Algorithmic problem:''' [[All pairs shortest paths]]

'''Algorithmic problem:''' [[Min-cost flow problem]] ...oblem to find a feasible flow is reduced to a [[Max-Flow Problems|max-flow problem]] as follows:

'''Algorithmic problem:''' [[Min-cost flow problem]]

'''Algorithmic problem:''' [[All pairs shortest paths]]

'''Algorithmic problem:''' [[Sorting based on pairwise comparison]]

'''Algorithmic problem:''' See the [[Binary Search Tree#Remark|remark clause]] of [[Binary Search

'''Algorithmic Problem:''' [[Sorted sequence#Find|Sorted Sequence:find]]

'''Algorithmic problem:''' [[Bounded priority queue|Bounded priority queue: decrease key]]

'''Algorithmic problem:''' [[Sorting based on pairwise comparison]]

'''Algorithmic problem:''' [[Bounded priority queue|Bounded priority queue: extract minimum]]

'''Algorithmic problem:''' [[All pairs shortest paths]]

'''Algorithmic problem:''' [[Max-Flow Problems#Standard version|Max-flow problems (standard versio

#[07:29] Welches Problem löst der Algorithmus von Kruskal genau? '''Algorithmic problem:''' [[Maximum spanning forest]]

'''Algorithmic problem:''' [[Bounded priority queue|Bounded priority queue: insert]]

'''Algorithmic problem:''' [[Blocking flow]].

'''Algorithmic problem:''' [[Sorted sequence#Find|Sorted sequence: find]]

'''Algorithmic problem:''' [[Ordered sequence#Remove|Ordered sequence: remove]]

'''Algorithmic problem:''' [[Heap as array|Heap as array: ascendItem]]

'''Algorithmic problem:''' [[Max-Flow Problems#Standard version|max-flow problem (standard version)]]

'''Algorithmic problem:''' [[Sorted sequence#Insert|Sorted sequence: insert]]

'''Algorithmic problem:''' [[Ordered sequence#Insert at position|Ordered sequence: insert at posit

'''Algorithmic problem:''' [[B-Trees|See B-Trees]]

'''Algorithmic problem:''' [[Min-cost flow problem]]

'''Algorithmic Problem:''' [[Sorted sequence#Remove|Sorted sequence:remove]]

'''Algorithmic problem:''' [[One-dimensional string matching]]

'''Algorithmic problem:''' [[Heap as array|Heap as array: descendItem]]

'''Algorithmic problem:''' [[Text here]]

'''Algorithmic problem:''' See [[B-Trees]]

'''Algorithmic problem:''' [[Strongly connected components]]

'''Algorithmic problem:''' [[Sorting Sequences of Strings]]

'''Algorithmic problem:''' [[Eulerian cycle]]

'''Algorithmic problem:'''

'''Algorithmic problem:''' [[Sorting based on pairwise comparison]]

'''Algorithmic problem:''' [[Max-Flow Problems#Standard version|Max-flow problems (standard versio

'''Algorithmic problem:''' [[Pivot partioning]]

'''Algorithmic problem:''' [[Blocking flow]].

'''Algorithmic problem:''' [[Minimum spanning tree]]

'''Algorithmic problem:''' [[Max-Flow Problems#Standard version|max-flow problem (standard version)]]

'''Algorithmic problem:'''

'''Algorithmic problem:''' [[One-dimensional string matching]]

'''Algorithmic problem:''' [[Sorted sequence#Traverse|Sorted sequence: traverse]]

'''Algorithmic problem:''' [[Maximum-weight matching]] in [[Basic graph definitions#Complete graph

'''Algorithmic problem:'''

'''Algorithmic problem:''' [[Graph traversal]]

'''Algorithmic problem:''' [[Maximum branching]]

'''Algorithmic problem:'''

'''Algorithmic problem:''' [[Sorted sequence#Insert|Sorted sequence: insert]]

'''Algorithmic problem:''' [[Max-Flow Problems#Standard version|Max-flow problems (standard versio

'''Algorithmic problem:''' [[Sorting based on pairwise comparison]]

'''Algorithmic problem:''' [[Sorted sequence#Remove|Sorted sequence: remove]]

'''Algorithmic problem:''' [[Graph traversal]]

'''Algorithmic problem:''' [[Single source shortest paths]]