Difference between revisions of "BFS, GAP"
Jump to navigation
Jump to search
| [checked revision] | [checked revision] |
| Line 1: | Line 1: | ||
| + | {{level-i}} | ||
| + | |||
Primary author of this description: [[:ru:Участник:Elijah|I.V.Afanasyev]]. | Primary author of this description: [[:ru:Участник:Elijah|I.V.Afanasyev]]. | ||
| − | = | + | = Links = |
| − | + | = Locality of data and computations = | |
| − | + | == Locality of implementation == | |
| − | + | === Structure of memory access and a qualitative estimation of locality === | |
| − | + | === Quantitative estimation of locality === | |
| − | |||
| − | + | = Scalability of the algorithm and its implementations = | |
| − | + | == Scalability of the algorithm == | |
| − | + | == Scalability of of the algorithm implementation == | |
| − | + | = Dynamic characteristics and efficiency of the algorithm implementation = | |
| − | + | = Run results = | |
{{Buttonlinkimp|36}} | {{Buttonlinkimp|36}} | ||
Latest revision as of 10:48, 2 July 2022
Primary author of this description: I.V.Afanasyev.
