The Digital Librarian's Digital Library
search
D
O
CIS
Do
cuments in
C
omputing and
I
nformation
S
cience
Home
>>
Journals and Conference Proceedings
>>
Algorithmica
Efficient Parallel Algorithms for Planar st-Graphs
Mikhail J. Atallah, Danny Z. Chen, Ovidiu Daescu
Journal Title: Algorithmica
Date: 2003
Volume: 35
Issue: 3
p. 194 - 215
We have been looking for this document on the Web. We think we have found the following, freely available version(s) of it:
http://www.nd.edu/%7Eodaescu/././isaac97.pdf/efficient-parallel-algorithms-for.pdf
http://www.nd.edu/~odaescu/././isaac97.ps.gz/efficient-parallel-algorithms-for.ps
http://www.utdallas.edu/~daescu/papers/stgraph.ps
For further information about this item go to:
http://link.springer.de/link/service/journals/00453/contents/02/0995/index.html
This data comes from
DBLP
This page is maintained by
Angela Cornwell
and
Thomas Krichel
.
It was last updated on 2006-04-12