Long pages

Showing below up to 50 results in range #71 to #120.

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

71. (hist) ‎Givens method, locality ‎[3,509 bytes]
72. (hist) ‎LU decomposition via Gaussian elimination, scalability ‎[3,407 bytes]
73. (hist) ‎Dot product, scalability ‎[3,105 bytes]
74. (hist) ‎Assignment problem ‎[2,797 bytes]
75. (hist) ‎DCSC for finding the strongly connected components, C++, MPI, Parallel Boost Graph Library ‎[2,639 bytes]
76. (hist) ‎Poisson equation, solving with DFT, scalability ‎[2,604 bytes]
77. (hist) ‎Householder (reflections) method for reducing of a matrix to Hessenberg form ‎[2,422 bytes]
78. (hist) ‎Purdom's, Boost Graph Library ‎[2,304 bytes]
79. (hist) ‎The dqds algorithm for calculating singular values of bidiagonal matrices ‎[1,840 bytes]
80. (hist) ‎Givens (rotations) method for the QR decomposition of a matrix ‎[1,809 bytes]
81. (hist) ‎Search for isomorphic subgraphs ‎[1,659 bytes]
82. (hist) ‎Kruskal's, C++, MPI, Parallel Boost Graph Library ‎[1,457 bytes]
83. (hist) ‎LU decomposition using Gaussian elimination with pivoting ‎[1,423 bytes]
84. (hist) ‎Householder (reflections) method for the QR decomposition of a matrix ‎[1,401 bytes]
85. (hist) ‎Dijkstra, C++, MPI: Parallel Boost Graph Library, 2 ‎[1,350 bytes]
86. (hist) ‎Boruvka's, C++, MPI, Parallel Boost Graph Library ‎[1,261 bytes]
87. (hist) ‎Longest shortest path, Java, WebGraph ‎[1,256 bytes]
88. (hist) ‎Cooley-Tukey, locality ‎[1,114 bytes]
89. (hist) ‎Dijkstra, C++, MPI: Parallel Boost Graph Library, 1 ‎[1,009 bytes]
90. (hist) ‎Δ-stepping, C++, MPI, Parallel Boost Graph Library ‎[964 bytes]
91. (hist) ‎Dijkstra, C++, Boost Graph Library ‎[963 bytes]
92. (hist) ‎DFS, C++, Boost Graph Library ‎[957 bytes]
93. (hist) ‎Triangular decomposition of a Gram matrix ‎[950 bytes]
94. (hist) ‎LU decomposition via Gaussian elimination ‎[943 bytes]
95. (hist) ‎Ford–Fulkerson, C++, Boost Graph Library ‎[937 bytes]
96. (hist) ‎Poisson equation, solving with DFT, PFFT ‎[918 bytes]
97. (hist) ‎Poisson equation, solving with DFT, AccFFT ‎[908 bytes]
98. (hist) ‎Poisson equation, solving with DFT, MKL FFT ‎[902 bytes]
99. (hist) ‎Poisson equation, solving with DFT, FFTE ‎[898 bytes]
100. (hist) ‎Poisson equation, solving with DFT, cuFFT ‎[897 bytes]
101. (hist) ‎Tarjan's strongly connected components, Python/C++, NetworKit ‎[897 bytes]
102. (hist) ‎Tarjan's strongly connected components, Python, NetworkX ‎[893 bytes]
103. (hist) ‎Dijkstra, Python ‎[891 bytes]
104. (hist) ‎Poisson equation, solving with DFT, P3DFFT ‎[890 bytes]
105. (hist) ‎Preflow-Push, Python, NetworkX ‎[886 bytes]
106. (hist) ‎Poisson equation, solving with DFT, FFTW ‎[882 bytes]
107. (hist) ‎Ford–Fulkerson, Python, NetworkX ‎[871 bytes]
108. (hist) ‎Tarjan's biconnected components, Python, NetworkX ‎[865 bytes]
109. (hist) ‎DFS, C++, MPI, Parallel Boost Graph Library ‎[845 bytes]
110. (hist) ‎Longest shortest path, Python/C++, NetworKit ‎[842 bytes]
111. (hist) ‎Hungarian, Java, JGraphT ‎[837 bytes]
112. (hist) ‎Kruskal's, C++, Boost Graph Library ‎[832 bytes]
113. (hist) ‎Prim's, C++, Boost Graph Library ‎[831 bytes]
114. (hist) ‎Floyd-Warshall, Python, NetworkX ‎[830 bytes]
115. (hist) ‎Bellman-Ford, Python, NetworkX ‎[827 bytes]
116. (hist) ‎Preflow-Push, C++, Boost Graph Library ‎[823 bytes]
117. (hist) ‎Kruskal's, Python, NetworkX ‎[821 bytes]
118. (hist) ‎Tarjan's strongly connected components, Java, WebGraph ‎[820 bytes]
119. (hist) ‎BFS, C++, Boost Graph Library ‎[820 bytes]
120. (hist) ‎Ford–Fulkerson, Java, JGraphT ‎[819 bytes]

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