New pages
Jump to navigation
Jump to search
(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)
- 18:23, 4 August 2015 Graph connectivity (hist) [9,572 bytes] ASA (talk | contribs) (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 Search for isomorphic subgraphs (hist) [1,659 bytes] ASA (talk | contribs) (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:21, 4 August 2015 Construction of the minimum spanning tree (MST) (hist) [9,031 bytes] ASA (talk | contribs) (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 Transitive closure of a directed graph (hist) [7,508 bytes] ASA (talk | contribs) (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 All Pairs Shortest Path (APSP) (hist) [10,383 bytes] ASA (talk | contribs) (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:18, 4 August 2015 Single Source Shortest Path (SSSP) (hist) [7,288 bytes] ASA (talk | contribs) (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...")
- 14:19, 30 July 2015 Backward substitution (hist) [16,438 bytes] ASA (talk | contribs) (Created page with "Primary authors of this description: A.V.Frolov, Vad.V.Voevodin (#Locality of data and computations|Section...")
- 16:43, 28 July 2015 LU decomposition via Gaussian elimination (hist) [943 bytes] ASA (talk | contribs) (Created page with "Primary authors of this description: Vad.V.Voevodin (Section 2.2), :ru:Участник:Teplov|A.M.Te...") originally created as "Gaussian elimination"
- 15:57, 22 July 2015 Open Encyclopedia of Parallel Algorithmic Features (hist) [110 bytes] ASA (talk | contribs) (Created page with "__NOTOC__ {{Main page}} ru:Открытая энциклопедия свойств алгоритмов")
- 17:53, 20 July 2015 Glossary (hist) [35,612 bytes] ASA (talk | contribs) (Created page with " === Временна́я локальность === '''Временная локальность''' (temporal locality) показывает среднее число обр...")
- 14:01, 16 July 2015 Dense matrix-vector multiplication (hist) [8,409 bytes] ASA (talk | contribs) (Created page with "Основные авторы описания: А.В.Фролов, Вад.В.Воеводин (#Описание л...")
- 09:32, 14 July 2015 Cooley–Tukey Fast Fourier Transform, radix-2 case (hist) [10,606 bytes] ASA (talk | contribs) (Created page with "Основные авторы описания: А.В.Фролов, Вад.В.Воеводин (#Описание л...")
- 09:26, 6 July 2015 Forward substitution (hist) [10,596 bytes] ASA (talk | contribs) (Created page with "Основные авторы описания: А.В.Фролов, Вад.В.Воеводин (#Описание л...")
- 18:18, 23 June 2015 Dot product (hist) [8,732 bytes] ASA (talk | contribs) (Created page with "== Программная реализация == === Особенности реализации последовательного алгоритма === В простей...")
- 11:03, 18 June 2015 Back substitution (hist) [0 bytes] ASA (talk | contribs) (Created page with "Основные авторы описания: А.В.Фролов, Вад.В.Воеводин (#Описание л...")
- 14:18, 14 May 2015 Horners method (hist) [6,835 bytes] ASA (talk | contribs) (Created page with "Основные авторы описания: А.В.Фролов, Вад.В.Воеводин (#Описание л...") originally created as "Horner's method"