Computer science eponyms: Difference between revisions
No edit summary |
No edit summary |
||
| Line 171: | Line 171: | ||
* Glushkov Automata | * Glushkov Automata | ||
* Goldreich-Goldwasser-Halevi scheme | * Goldreich-Goldwasser-Halevi scheme | ||
* Gomory-Hu Tree | * The weighted '''Gomory-Hu Tree''' of an undirected graph with capacities G represents the minimum s-t cuts for all s-t pairs in G, and is computable via |V|-1 maximum flow problems. | ||
* Gordon–Newell theorem | * Gordon–Newell theorem | ||
* Gosper's Hack | * Gosper's Hack | ||