Maintenance of Transitive Closures and Transitive Reductions of Graphs

Authors:
Johannes A. La Poutré;Jan van Leeuwen
Affiliations:
-;-
Venue:
WG '87 Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science
Year:
1987

Citing 0
Cited 6

Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
An Experimental Study of Dynamic Algorithms for Transitive Closure

Journal of Experimental Algorithmics (JEA)
On the transitive closure representation and adjustable compression

Proceedings of the 2006 ACM symposium on Applied computing
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths

Journal of Algorithms
On the foundations of computing deltas between RDF models

ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
On Computing Deltas of RDF/S Knowledge Bases

ACM Transactions on the Web (TWEB)

Quantified Score

Hi-index	0.00

Visualization

Abstract