Výsledky vyhľadávania - f.2.2 [analysis of algorithms and problem complexity]: nonnumerical algorithms and problemys~

Using Expander Graphs to Find Vertex Connectivity.

Autori: Gabow, Harold N.

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

Predmety: GRAPHIC methods, DIRECTED graphs, ALGORITHMS, GRAPH theory, COMPUTATIONAL complexity

Optimal Parallel Selection.

Autori: Yijie Han

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

Predmety: COMPUTER programming, MACHINE theory, ALGORITHMS, SELECTION theorems, ELECTRONIC data processing, GRAPH algorithms