Pages with the most revisions

Showing below up to 50 results in range #51 to #100.

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

51. Givens (rotations) method for the QR decomposition of a (real) Hessenberg matrix‏‎ (5 revisions)
52. Glossary‏‎ (5 revisions)
53. BFS, Ligra‏‎ (5 revisions)
54. BFS, Python/C++, NetworKit‏‎ (4 revisions)
55. Purdom's, Boost Graph Library‏‎ (4 revisions)
56. Cholesky decomposition, scalability‏‎ (4 revisions)
57. Triangular decomposition of a Gram matrix‏‎ (4 revisions)
58. Gaussian elimination, compact scheme for tridiagonal matrices, serial version‏‎ (4 revisions)
59. Graph connectivity‏‎ (4 revisions)
60. Cholesky decomposition, locality‏‎ (4 revisions)
61. Help‏‎ (3 revisions)
62. Two-sided Thomas algorithm, pointwise version‏‎ (3 revisions)
63. Unitary-triangular factorizations‏‎ (3 revisions)
64. Transitive closure of a directed graph‏‎ (3 revisions)
65. All Pairs Shortest Path (APSP)‏‎ (3 revisions)
66. Cooley-Tukey, locality‏‎ (3 revisions)
67. LU decomposition using Gaussian elimination without pivoting‏‎ (3 revisions)
68. Floyd-Warshall algorithm‏‎ (3 revisions)
69. Shiloach-Vishkin algorithm for finding the connected components‏‎ (3 revisions)
70. Dijkstra, VGL, push‏‎ (3 revisions)
71. Finding maximal flow in a transportation network‏‎ (3 revisions)
72. Search for isomorphic subgraphs‏‎ (3 revisions)
73. Householder (reflections) method for the QR decomposition of a (real) Hessenberg matrix‏‎ (3 revisions)
74. Givens (rotations) method for the QR decomposition of a matrix‏‎ (3 revisions)
75. Tarjan-Vishkin biconnected components algorithm‏‎ (2 revisions)
76. Householder (reflections) method for reducing of a matrix to Hessenberg form‏‎ (2 revisions)
77. Stone doubling algorithm for solving bidiagonal SLAEs‏‎ (2 revisions)
78. Assignment problem‏‎ (2 revisions)
79. Ford–Fulkerson, Java, JGraphT‏‎ (2 revisions)
80. Cholesky decomposition, SCALAPACK‏‎ (2 revisions)
81. Gaussian elimination with row pivoting‏‎ (2 revisions)
82. Householder (reflections) method for the QR decomposition of a matrix‏‎ (2 revisions)
83. Gaussian elimination (finding the LU decomposition)‏‎ (2 revisions)
84. Kruskal's, C++, MPI, Parallel Boost Graph Library‏‎ (2 revisions)
85. BFS, VGL‏‎ (2 revisions)
86. Thomas algorithm, pointwise version‏‎ (2 revisions)
87. Open Encyclopedia of Parallel Algorithmic Features‏‎ (2 revisions)
88. Tarjan's strongly connected components, Java, JGraphT‏‎ (2 revisions)
89. Householder (reflections) method for reducing a complex Hermitian matrix to symmetric tridiagonal form‏‎ (2 revisions)
90. K-means clustering, scalability1‏‎ (1 revision)
91. Complete cyclic reduction, locality‏‎ (1 revision)
92. Matrix decomposition problem‏‎ (1 revision)
93. Complete cyclic reduction‏‎ (1 revision)
94. Householder (reflections) reduction of a matrix to bidiagonal form, locality‏‎ (1 revision)
95. Unitary reductions to Hessenberg form‏‎ (1 revision)
96. K-means clustering, SAP HANA‏‎ (1 revision)
97. Floyd-Warshall, C++, Boost Graph Library‏‎ (1 revision)
98. Longest shortest path, Python/C++, NetworKit‏‎ (1 revision)
99. Kaczmarz's, MATLAB3‏‎ (1 revision)
100. K-means clustering, Spark‏‎ (1 revision)

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)