A fast algorithm for computing transitive relation

The transitive relation of a finite set Swith size S|S|= nis verified quickly by the relational inequality M 2 ≤Mthat needs 2n; 3 computations. In this paper, a table oriented audit method based on message passing protocol only needs computations to conduct the verification of transitive relation an...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	International journal of computer mathematics 1999-01, Vol.70 (3), p.495-504
Hauptverfasser:	Liao, Ping-Sung, Chen, Tse-Sheng, Chung, Pau-Choo
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Combinatorics Combinatorics. Ordered structures Exact sciences and technology Flows in networks. Combinatorial problems G2.1 G2.2 Graph theory Mathematics message passing protocol Operational research and scientific management Operational research. Management science relation matrix Sciences and techniques of general use Transitive relation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	The transitive relation of a finite set Swith size S\|S\|= nis verified quickly by the relational inequality M 2 ≤Mthat needs 2n; 3 computations. In this paper, a table oriented audit method based on message passing protocol only needs computations to conduct the verification of transitive relation and it is always less than the relational inequality.
ISSN:	0020-7160 1029-0265
DOI:	10.1080/00207169908804770