Pregled bibliografske jedinice broj: 16970
Gaussian block algorithms for solving path problems
Gaussian block algorithms for solving path problems // Mathematical communications, 3 (1998), 1; 67-81 (podatak o recenziji nije dostupan, članak, znanstveni)
CROSBI ID: 16970 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Gaussian block algorithms for solving path problems
Autori
Manger, Robert
Izvornik
Mathematical communications (1331-0623) 3
(1998), 1;
67-81
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
path problems; path algebras; block algorithms; Gaussian elimination; parallel computing
Sažetak
Path problems are a family of optimization and enumeration problems that reduce to determination or evaluation of paths in a directed graph. In this paper we give a convenient algebraic description of block algorithms for solving path problems. We also develop block versions of two Gaussian algorithms, which are counterparts of the conventional Jordan and escalator method respectively. The correctness of the two considered block algorithms is discussed, and their complexity is analyzed. A parallel implementation of the block Jordan algorithm on a transputer network is presented, and the obtained experimental results are listed.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
POVEZANOST RADA
Projekti:
037010
Ustanove:
Prirodoslovno-matematički fakultet, Matematički odjel, Zagreb
Profili:
Robert Manger
(autor)
Citiraj ovu publikaciju:
Uključenost u ostale bibliografske baze podataka::
- MathSciNet
- Current Mathematical Publications
- Mathematical Review
- Zentralblatt fur Mathematik/Mathematics Abstracts
- MATH on STN International
