✦ LIBER ✦

Two algorithms for computing regular equivalence

✍ Scribed by Stephen P. Borgatti; Martin G. Everett

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 889 KB
Volume: 15
Category: Article
ISSN: 0378-8733
DOI: 10.1016/0378-8733(93)90012-a

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper we present two algorithms for computing the extent of regular equivalence among pairs of nodes in a network. The first algorithm, REGE, is well known, but has not previously been described in the literature.

📜 SIMILAR VOLUMES

Multi-dimensional parallel computing str

Multi-dimensional parallel computing structures for regular iterative algorithms

✍ Chein-Wei Jen; Ding-Ming Kwai 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 438 KB

Two noniterative algorithms for computin

Two noniterative algorithms for computing posteriors

✍ Jun Yang; Guohua Zou; Yu Zhao 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 192 KB

Two computational algorithms for derivin

Two computational algorithms for deriving phase equations: Equivalence and some cautions

✍ Daisuke Ohta; Hisa-Aki Tanaka; Yusuke Maino 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 510 KB

Probabilistic algorithms for computing r

Probabilistic algorithms for computing resolvent representations of regular differential ideals

✍ Thomas Cluzeau; Evelyne Hubert 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 367 KB

An equivalence between two algorithms fo

An equivalence between two algorithms for quadratic programming

✍ Jong-Shi Pang 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 634 KB

An efficient algorithm for computing bis

An efficient algorithm for computing bisimulation equivalence

✍ Agostino Dovier; Carla Piazza; Alberto Policriti 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 613 KB