Computer science eponyms: Difference between revisions
heap's algorithm |
No edit summary |
||
| Line 402: | Line 402: | ||
* Stehlé-Zimmermann algorithm | * Stehlé-Zimmermann algorithm | ||
* '''Steiner tree problems''' are a class of combinatorial optimization problems involving determining the optimal interconnect of a graph under some objective function. | * '''Steiner tree problems''' are a class of combinatorial optimization problems involving determining the optimal interconnect of a graph under some objective function. | ||
* Steinhaus-Johnson-Trotter algorithm | * the '''Steinhaus-Johnson-Trotter algorithm''' generates all permutations of a set (<i>CACM 1964</i>) | ||
* Strassen's Algorithm | * Strassen's Algorithm | ||
* Suurballe's Algorithm | * Suurballe's Algorithm | ||