Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 5, 1975 - Issue 1-4
Submit an article Journal homepage
10
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

On efficiently computing the product of two binary relations

Jan van Leeuwen Dept. of Mathematics, University of Utrecht, Utrecht, 2506, Netherlands
Pages 193-201 | Published online: 21 Dec 2010

References

  • Aho , A. V. , Hopcroft , J. E. and Ullman , J. D. 1974 . The analysis of computer algorithms , Addison-Wesley .
  • Arlazarov , V. L. , Dinic , E. A. , Kronrod , M. A. and Faradžev , I. A. 1970 . On economical construction of the transitive closure of an oriented graph . Dokl. Akad. Nauk SSSR , 194 : 1209 – 1210 . translated in: Soviet Math. Dokl.11 (1970)
  • Cook , S. A. Linear time simulation of deterministic 2-way push-down automata . Proceedings IFIP . Vol. 71 , pp. 75 – 80 . North Holland Publ. Comp. .
  • Cook , S. A. and Reckhow , R. A. 1973 . Time-bounded random access machines . JCSS , 7 : 354 – 375 .
  • Fischer , P. C. Further schemes for combining matrix algorithms . Proceedings 2nd Colloquium on Automata, Languages, and Programming . Saarbrücken. Vol. 14 , pp. 428 – 436 . Springer Lecture Notes in Computer Sciecne .
  • Fischer , P. C. and Probert , R. L. Efficient procedures for using matrix algorithms . Proceedings 2nd Colloquium on Automata, Languages, and Programming . Saarbrücken. Vol. 14 , pp. 413 – 427 . Springer Lecture Notes in Computer Science .
  • Fischer , M. J. and Meyer , A. R. 1971 . Boolean matrix multiplication and transitive closure . Proceedings IEEE Twelfth's Symp. on Switching and Automata Theory . 1971 . pp. 129 – 131 .
  • Furman , M. E. 1970 . Application of a method of fast multiplication of matrices in the problem of finding the transitive closure of a graph . Dokl. Akad.,Nauk SSSR , 194 : 1252 translated in Soviet Math. Dokl. 11 (1970)
  • Kalnin'sh , A. A. 1971 . The coloring of graphs in a linear number of steps . Kibernetika , 4 : 103 – 111 . translated in Cybernetics (1973) 691-700.
  • Munro , I. 1971 . Efficient determination of the strongly connected components and transitive closure of a graph . Inf. Proc. letters , 1 : 56 – 58 .
  • O'Neil , P. E. and O'Neil , E. J. 1973 . A fast expected time algorithm for Boolean matrix multiplication and transitive closure . Inform. & Control , 22 : 132 – 138 .
  • Strassen , V. 1969 . Gaussian elimination is not optimal . Numer. Math. , 13 : 354 – 356 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.