Suchergebnisse - analysis of algorithms and problemy complexity—nonnumerical algorithms and problems general terms

Computing All Maps into a Sphere.

Autoren: ČADEK, MARTIN KRČÁL, MAREK MATOUŠEK, JIŘÍ et al.

Quelle: Journal of the ACM; May2014, Vol. 61 Issue 3, p17:1-17:44, 44p

Schlagwörter: ALGEBRAIC topology, HOMOTOPY groups, TOPOLOGICAL spaces, FUNDAMENTAL groups (Mathematics), POLYNOMIAL time algorithms

Using Expander Graphs to Find Vertex Connectivity.

Autoren: Gabow, Harold N.

Quelle: Journal of the ACM; Sep2006, Vol. 53 Issue 5, p800-844, 45p

Schlagwörter: GRAPHIC methods, DIRECTED graphs, ALGORITHMS, GRAPH theory, COMPUTATIONAL complexity

Optimal Parallel Selection.

Autoren: Yijie Han

Quelle: ACM Transactions on Algorithms; 2007, Vol. 3 Issue 4, p38.1-38.11, 11p, 1 Diagram

Schlagwörter: COMPUTER programming, MACHINE theory, ALGORITHMS, SELECTION theorems, ELECTRONIC data processing, GRAPH algorithms