User contributions
Jump to navigation
Jump to search
- 16:37, 2 February 2016 diff hist -16 Givens method
- 16:30, 2 February 2016 diff hist -3 Horners method
- 16:28, 2 February 2016 diff hist -1 Algorithm classification
- 17:25, 1 February 2016 diff hist -1 Givens method
- 17:24, 1 February 2016 diff hist -5 Givens method →Information graph
- 17:20, 1 February 2016 diff hist +3 Givens method →Information graph
- 16:15, 1 February 2016 diff hist +1,396 Givens method
- 16:17, 6 August 2015 diff hist -2 About project
- 18:26, 4 August 2015 diff hist +2,784 N Assignment problem Created page with "== Formulation of the problem == Suppose that there are <math>n</math> agents and <math>m</math> tasks, which can be distributed between these agents. Only one task can be as..."
- 18:25, 4 August 2015 diff hist +3,589 N Finding maximal flow in a transportation network Created page with "== Formulation of the problem == A ''transportation network'' is a directed graph <math>G = (V, E)</math> in which a nonnegative capacity <math>c(e) \ge 0</math> is assigned..."
- 18:24, 4 August 2015 diff hist 0 Graph connectivity →Basic definitions
- 18:23, 4 August 2015 diff hist +9,515 N Graph connectivity Created page with "== Basic definitions == Let <math>G = (V, E)</math> be a given (directed or undirected) graph. The sequence <math>P(u, v)</math> of edges <math>e_1 = (u, w_1)</math>, <math>..."
- 18:22, 4 August 2015 diff hist +1,586 N Search for isomorphic subgraphs Created page with "== Formulation of the problem == Let <math>G</math> and <math>H</math> be given graphs. '''Search for isomorphic subgraphs''' consists in finding out whether the graph <math>..."
- 18:22, 4 August 2015 diff hist 0 Construction of the minimum spanning tree (MST) →Properties of the problem
- 18:21, 4 August 2015 diff hist +8,891 N Construction of the minimum spanning tree (MST) Created page with "== Formulation of the problem == Let <math>G = (V, E)</math> be a given connected, undirected graph with edge weights <math>f(e)</math>. A subgraph that is a tree and connect..."
- 18:20, 4 August 2015 diff hist +7,414 N Transitive closure of a directed graph Created page with "== Formulation of the problem == Let <math>G = (V, E)</math> be a directed graph. The sequence <math>P(u, v)</math> of edges <math>e_1 = (u, w_1)</math>, <math>e_2 = (w_1, w..."
- 18:20, 4 August 2015 diff hist +10,275 N All Pairs Shortest Path (APSP) Created page with "== Formulation of the problem == Let <math>G = (V, E)</math> be a given graph with edge weights <math>f(e)</math>, <math>e \in E</math>. The sequence <math>P(u, v)</math> o..."
- 18:19, 4 August 2015 diff hist -41 Single Source Shortest Path (SSSP)
- 18:18, 4 August 2015 diff hist +7,084 N Single Source Shortest Path (SSSP) Created page with "= Single Source Shortest Path (SSSP) = == Formulation of the problem == Let <math>G = (V, E)</math> be a given graph with edge weights <math>f(e)</math> and a marked verte..."
- 18:14, 4 August 2015 diff hist +328 Algorithm classification
- 14:30, 30 July 2015 diff hist -10 Horners method
- 14:21, 30 July 2015 diff hist -23,936 Back substitution Blanked the page current
- 14:21, 30 July 2015 diff hist -57 Backward substitution →Properties of the algorithm
- 14:20, 30 July 2015 diff hist -22 Backward substitution →Information graph
- 14:19, 30 July 2015 diff hist +23,936 N Backward substitution Created page with "Primary authors of this description: A.V.Frolov, Vad.V.Voevodin (#Locality of data and computations|Section..."
- 14:19, 30 July 2015 diff hist +4 Algorithm classification
- 14:18, 30 July 2015 diff hist -649 Back substitution
- 14:06, 30 July 2015 diff hist +33 Dot product
- 13:55, 30 July 2015 diff hist 0 Dense matrix multiplication (serial version for real matrices) →Quantitative estimation of locality
- 13:44, 30 July 2015 diff hist +10 Dense matrix-vector multiplication →Information graph
- 13:44, 30 July 2015 diff hist +810 Dense matrix-vector multiplication
- 13:42, 30 July 2015 diff hist +820 Pairwise summation of numbers
- 12:03, 30 July 2015 diff hist +43 Cholesky decomposition →Computational kernel of the algorithm
- 12:02, 30 July 2015 diff hist -1 Cholesky decomposition →Computational kernel of the algorithm
- 12:02, 30 July 2015 diff hist -60 Cholesky decomposition →Computational kernel of the algorithm
- 12:01, 30 July 2015 diff hist -66 Cholesky decomposition
- 11:49, 30 July 2015 diff hist -31 Cholesky decomposition
- 17:03, 28 July 2015 diff hist +29 Algorithm classification
- 16:58, 28 July 2015 diff hist -1 Horners method
- 16:58, 28 July 2015 diff hist +31 LU decomposition via Gaussian elimination
- 16:57, 28 July 2015 diff hist +64 LU decomposition via Gaussian elimination
- 16:44, 28 July 2015 diff hist -9,647 Forward substitution
- 16:43, 28 July 2015 diff hist +11,180 N LU decomposition via Gaussian elimination Created page with "Primary authors of this description: Vad.V.Voevodin (Section 2.2), :ru:Участник:Teplov|A.M.Te..."
- 11:02, 28 July 2015 diff hist -3 Dense matrix multiplication (serial version for real matrices) →Input and output data of the algorithm
- 15:27, 24 July 2015 diff hist +94 Dot product
- 15:15, 24 July 2015 diff hist -82 Cooley–Tukey Fast Fourier Transform, radix-2 case
- 15:03, 24 July 2015 diff hist -8 Dense matrix multiplication (serial version for real matrices)
- 14:25, 24 July 2015 diff hist -2 Forward substitution →Implementation peculiarities of the serial algorithm
- 16:27, 23 July 2015 diff hist +18 Forward substitution
- 16:25, 23 July 2015 diff hist +21 Cholesky decomposition