Product
Help
Pricing
About
Jobs
Log in
Get started
Work
Add to collection
A parallel algorithm for transitive closure
HTML
Details
Locations
Year:
2002
Type:
article
Source:
Parallel and distributed computing and systems
Authors:
Edson N. Cáceres,
Siang Wun Song,
Jayme L. Szwarcfiter
Institutions:
Universidade Federal de Mato Grosso do Sul,
Universidade de São Paulo,
Universidade Federal do Rio de Janeiro
Language:
English
Topic:
Complexity and Algorithms in Graphs
Subfield:
Computational Theory and Mathematics
Field:
Computer Science
Domain:
Physical Sciences
Keywords:
transitive closure,
acyclic digraphs,
parallel algorithms,
communication complexity,
distributed graph algorithms
Open Access status:
closed
Funders:
Foundation for the National Institutes of Health,
W. M. Keck Foundation,
National Institutes of Health,
Defense Advanced Research Projects Agency,
National Institute of Allergy and Infectious Diseases,
Division of Chemical, Bioengineering, Environmental, and Transport Systems
show all 6
Awards:
G1481568651,
G1582025434,
G2145459977,
Macrophages, Granulomas, and Bacterial Persistence,
G3709580507,
A Novel Screen for Antibacterials that Are Non-Toxic to Mammals,
G5409257445,
G6356285224,
G8024305749,
Caenorhabditis Genetics Center
show all 10
OpenAlex ID:
W28983513
FWCI:
0.735
Cites:
16
Cited by:
5
Related to:
10