Fast algorithm for computing transitive relation

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

doi:10.1080/00207169908804770

Fast algorithm for computing transitive relation

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

通訊工程研究所

研究成果: Article › 同行評審

摘要

The transitive relation of a finite set S with size |S| = n is verified quickly by the relational inequality M²≤M that needs 2n³ computations. In this paper, a table oriented audit method based on message passing protocol only needs 2 ∑_node ^{n = node} = i_node·O_node computations to conduct the verification of transitive relation and it is always less than the relational inequality.

原文	English
頁（從 - 到）	495-504
頁數	10
期刊	International Journal of Computer Mathematics
卷	70
發行號	3
DOIs	https://doi.org/10.1080/00207169908804770
出版狀態	Published - 1999 1月 1

All Science Journal Classification (ASJC) codes

電腦科學應用
計算機理論與數學
應用數學

存取文件

10.1080/00207169908804770

其它文件與鏈接

引用此

@article{fd9ce3d680ed48afaccf8d19238369ae,

title = "Fast algorithm for computing transitive relation",

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.",

author = "Liao, \{Ping Sung\} and Chen, \{Tse Sheng\} and Pau-Choo Chung",

year = "1999",

month = jan,

day = "1",

doi = "10.1080/00207169908804770",

language = "English",

volume = "70",

pages = "495--504",

journal = "International Journal of Computer Mathematics",

issn = "0020-7160",

publisher = "Taylor and Francis Ltd.",

number = "3",

}

TY - JOUR

T1 - Fast algorithm for computing transitive relation

AU - Liao, Ping Sung

AU - Chen, Tse Sheng

AU - Chung, Pau-Choo

PY - 1999/1/1

Y1 - 1999/1/1

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0032628072

UR - https://www.scopus.com/pages/publications/0032628072#tab=citedBy

U2 - 10.1080/00207169908804770

DO - 10.1080/00207169908804770

M3 - Article

AN - SCOPUS:0032628072

SN - 0020-7160

VL - 70

SP - 495

EP - 504

JO - International Journal of Computer Mathematics

JF - International Journal of Computer Mathematics

IS - 3

ER -

Fast algorithm for computing transitive relation

摘要

All Science Journal Classification (ASJC) codes

存取文件

其它文件與鏈接

指紋

引用此