On computing the transitive closure of a relation-Reference-Cited by-同舟云学术

On computing the transitive closure of a relation

Published:1977-10 Issue:4 Volume:8 Page:303-314
ISSN:0001-5903
Container-title:Acta Informatica
language:en
Short-container-title:Acta Informatica

Author:

Eve J.,Kurki-Suonio R.

Publisher

Springer Science and Business Media LLC

Subject

Computer Networks and Communications,Information Systems,Software

Link

http://link.springer.com/content/pdf/10.1007/BF00271339.pdf

Reference8 articles.

1. Artazarov, V.L., Dinic, E.A., Kronrod, D.A., Faradzev, I.A.: On economical construction of the transitive closure of a directed graph. Soviet Math. Dokl. 11, 1209–1210 (1970)

2. Furman, F.E.: Application of a method of fast multiplication of matrices in the problem of finding the transitive closure of a graph. Soviet Math. Dokl. 11, 1252 (1970)

3. Knuth, D.E.: Top-down syntax analysis. Acta Informat. 1, 79–110 (1971)

4. Knuth, D.E.: The art of computer programming, Vol. 1, 2nd ed. Reading (Mass): Addison-Wesley 1973

5. Purdom, P.: A transitive closure algorithm. BIT 10, 76–94 (1970)

Cited by 40 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Finding strong components using depth-first search;European Journal of Combinatorics;2023-10

2. Causal Pathway Extraction from Web-Board Documents;Applied Sciences;2021-11-03

3. Stubborn Sets, Frozen Actions, and Fair Testing;Fundamenta Informaticae;2021-01-13

4. Utilizing object reference graphs and garbage collection roots to detect memory leaks in offline memory monitoring;Proceedings of the 15th International Conference on Managed Languages & Runtimes - ManLang '18;2018

5. Fair testing and stubborn sets;International Journal on Software Tools for Technology Transfer;2017-12-11