Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

A fast algorithm for computing transitive relation

From MaRDI portal
Publication:4243275
Jump to:navigation, search

DOI10.1080/00207169908804770zbMath0926.68055OpenAlexW2064043950WikidataQ126245790 ScholiaQ126245790MaRDI QIDQ4243275

Tse-Sheng Chen, Pau-Choo Chung, Ping-Sung Liao

Publication date: 8 November 1999

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169908804770


zbMATH Keywords

transitive relationrelation matrixmessage passing protocol


Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)








This page was built for publication: A fast algorithm for computing transitive relation

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4243275&oldid=18130905"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 16:03.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki