Search results

Create the page "Max" on this wiki! See also the search results found.

Page title matches

• Max flow
  26 B (3 words) - 01:09, 7 September 2013
• Max subvector sum
  35 B (4 words) - 21:19, 9 April 2012
• Max-flow min-cut theorem
  The [[max-flow min-cut theorem]] is an important result in [[graph theory]]. It state As a consequence of this theorem, every max flow algorithm may be employed to solve the minimum s-t cut problem, and ''
  5 KB (1,048 words) - 03:18, 9 September 2013

Page text matches

• Maximum flow
  The max flow problem may be expressed as a [[linear program]] and solved using the ...he two approaches gives a lower bound of <math>O(VE)</math> on the general max flow problem, the best known to date.
  17 KB (3,143 words) - 03:22, 9 September 2013
• Dynamic programming
  return A[x,y]+max(plentiful_paths(A,x-1,y),plentiful_paths(A,x,y-1)) ...-1,y) or the same for (x,y-1), ''whichever is greater'' (that is to say, ''max(plentiful_paths(A,x-1,y),plentiful_paths(A,x,y-1))''), ''plus'' one if ther
  34 KB (6,107 words) - 14:38, 9 February 2016
• Segment tree
  Analogously to the minimum: all <code>min</code> operations replaced by <code>max</code>. ...on-leaf node is the sum of the total sums at the two children. To find the max prefix sum at a non-leaf node, we notice that the maximal sum prefix ends e
  21 KB (3,669 words) - 02:34, 6 April 2016
• Convex hull trick
  dp[n] &larr; max(dp[n], dp[k] + adjust(k + 1 , n))
  19 KB (3,419 words) - 02:24, 13 September 2023
• Big numbers
  p &larr; max(m,n) int p = max(n,m);
  13 KB (2,098 words) - 20:22, 28 June 2011
• Longest palindromic subsequence
  \max(f(i+1,j),f(i,j-1)) & \text{if } j-i > 1 \text{ and } S_i \neq S_{j-1} \\
  9 KB (1,529 words) - 01:10, 3 May 2022
• Longest common subsequence
  \max(\operatorname{LCS\_len}(p,q-1),\operatorname{LCS\_len}(p-1,q)) & \text{othe
  17 KB (2,927 words) - 05:07, 31 May 2011
• Longest increasing subsequence
  :<math>\operatorname{LIS\_len}'(i) = 1 + \max (\{\operatorname{LIS\_len}'(j) \mid 1 \leq j < i \wedge x_j \leq x_i\} \cup lis[i] &larr; max(lis[i],1+lis[j])
  14 KB (2,315 words) - 11:10, 10 June 2018
• Longest common substring
  result &larr; max(result,a[i][j])
  7 KB (1,242 words) - 04:49, 29 May 2011
• Equivalence relation
  ...th>D</math> is a quantity named the ''Dehn invariant'' after its inventor, Max Dehn.
  12 KB (2,069 words) - 02:44, 24 April 2011
• Binary heap
  ...er than the labels of its children, if any. (We call this variation the '''max heap''', because the maximum element is at the root; the '''min heap''' is ...t never violate the completeness property, but may temporarily violate the max-heap property.
  9 KB (1,704 words) - 08:58, 27 July 2014
• Greatest common divisor
  ...ath>b</math> can be computed using the Euclidean algorithm in <math>O(\log\max(a,b))</math> mod operations. ...{a}{2}</math>. So in either case, after at most two mod operations, <math>\max(a,b)</math> is reduced by at least a factor of 2.
  13 KB (2,277 words) - 20:46, 11 December 2011
• Least common multiple
  ...operatorname{lcm}(x,y) = p_1^{\max(k_1,l_1)} p_2^{\max(k_2,l_2)} ... p_n^{\max(k_n,l_n)}</math>. Therefore, it is possible to find the LCM of two integers
  3 KB (520 words) - 20:58, 11 December 2011
• Heap
  ...ed-tree'' and ''min-heap'' are defined analogously. A ''heap'' is either a max-heap or a min-heap.
  748 B (113 words) - 23:31, 11 December 2011
• Binary search
  * {{Problem|ccc96s5|Max Distance}}
  21 KB (3,719 words) - 05:17, 19 March 2017
• Binomial heap
  ...' subtree, but not necessarily its ''right''. (This is a relaxation of the max-heap property.) * Binomial trees are fully max-heap-ordered, rather than simply left-max-heap-ordered like power-of-two trees.
  15 KB (2,633 words) - 06:16, 10 October 2012
• Maximum subvector sum
  ...bvector sum for the entire array <math>A</math> is then, of course, <math>\max(M_0, M_1, M_2, \ldots, M_n)</math>. <math>M_i</math> for <math>i > 0</math> :<math>M_i = \max(A_i, A_i + M_{i-1}) = A_i + \max(0, M_{i-1})</math>
  9 KB (1,454 words) - 06:09, 3 May 2012
• Convex hull trick/commando.cpp
  dp[n] = max(dp[n] , b * sum[n] + a * sum[n] * sum[n] + c + query(sum[n]));
  2 KB (267 words) - 14:31, 11 March 2016
• Ford–Fulkerson method
  ...gmenting path can no longer be found. The final flow <math>f_n</math> is a max flow. ...o more than <math>M</math> steps, where <math>M</math> is the value of the max flow. A similar argument applies when all edge weights are rational.
  3 KB (506 words) - 04:12, 9 September 2013
• Edmonds–Karp algorithm
  output max flow f output max flow value F
  2 KB (301 words) - 04:36, 9 September 2013