Abstract
The transitive relation of a finite set S with size |S| = n is verified quickly by the relational inequality M2≤M that needs 2n3 computations. In this paper, a table oriented audit method based on message passing protocol only needs 2 ∑node n = node = inode·Onode computations to conduct the verification of transitive relation and it is always less than the relational inequality.
Original language | English |
---|---|
Pages (from-to) | 495-504 |
Number of pages | 10 |
Journal | International Journal of Computer Mathematics |
Volume | 70 |
Issue number | 3 |
DOIs | |
Publication status | Published - 1999 Jan 1 |
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Computational Theory and Mathematics
- Applied Mathematics