Algorithms for transitive closure

This article is hosted on another website.

You may be required to register, activate a subscription or purchase the article before you can obtain the full text.


Download / Buy Article:

Keywords: Algorithms; Computational complexity; Graph algorithms; Transitive closure

Document Type: Short Communication


Affiliations: 1The second author gratefully acknowledges the support of the project LN00A056 of The Ministry of Education of the Czech Republic.Department of Software Engineering, Faculty of Mathematics and Physics, Charles University, Malostranske nam.25, 11800 1, Praha, Czech Republic

Publication date: March 31, 2002

Related content



Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more