Geodesic
Selected Parallel Combinatorial Algorithms
Mathematica Applicanda, Tome 14 (1986) no. 28, pp. 91-123.

Voir la notice de l'article provenant de la source Annales Societatis Mathematicae Polonae Series

The paper presents several parallel algorithms for some combinatorial problems, mainly for problems in graph theory. The SIMD. - shared memory (single instruction multiple data) model is considered. For each algorithm the computational complexity and number of processors needed are examined. The efficiency of parallel algorithms is examined by somparing with sequential algorithms.
DOI : 10.14708/ma.v14i28.1678
Classification : 68Q20 (05-04)
Mots-clés : Nonnumerical algorithms, Explicit machine computation and programs 
@article{10_14708_ma_v14i28_1678,
     author = {Krzysztof Dudzi\'nski},
     title = {Selected {Parallel} {Combinatorial} {Algorithms}},
     journal = {Mathematica Applicanda},
     pages = { 91--123},
     publisher = {mathdoc},
     volume = {14},
     number = {28},
     year = {1986},
     doi = {10.14708/ma.v14i28.1678},
     language = {pl},
     url = {http://geodesic.mathdoc.fr/articles/10.14708/ma.v14i28.1678/}
}
TY  - JOUR
AU  - Krzysztof Dudziński
TI  - Selected Parallel Combinatorial Algorithms
JO  - Mathematica Applicanda
PY  - 1986
SP  -  91
EP  - 123
VL  - 14
IS  - 28
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.14708/ma.v14i28.1678/
DO  - 10.14708/ma.v14i28.1678
LA  - pl
ID  - 10_14708_ma_v14i28_1678
ER  - 
%0 Journal Article
%A Krzysztof Dudziński
%T Selected Parallel Combinatorial Algorithms
%J Mathematica Applicanda
%D 1986
%P  91-123
%V 14
%N 28
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.14708/ma.v14i28.1678/
%R 10.14708/ma.v14i28.1678
%G pl
%F 10_14708_ma_v14i28_1678
Krzysztof Dudziński. Selected Parallel Combinatorial Algorithms. Mathematica Applicanda, Tome 14 (1986) no. 28, pp.  91-123. doi : 10.14708/ma.v14i28.1678. http://geodesic.mathdoc.fr/articles/10.14708/ma.v14i28.1678/

Cité par Sources :