A new method for generating compressed representation of transitive closure
Abstract
References
Index Terms
- A new method for generating compressed representation of transitive closure
Recommendations
On the transitive closure representation and adjustable compression
SAC '06: Proceedings of the 2006 ACM symposium on Applied computingA composite object represented as a directed graph (digraph for short) is an important data structure that requires efficient support in CAD/CAM, CASE, office systems, software management, web databases, and document databases. It is cumbersome to ...
Speeding up dynamic transitive closure for bounded degree graphs
In this paper we present an algorithm for solving two problems in dynamically maintaining the transitive closure of a digraph: In the first problem a sequence of edge insertions is performed on an initially empty graph, interspersed withp transitive ...
A transitive closure algorithm
AbstractAn algorithm is given for computing the transitive closure of a directed graph in a time no greater thana 1 N 1 n+a 2 n 2 for largen wherea 1 anda 2 are constants depending on the computer used to execute the algorithm,n is the number of nodes in the graph ...
Comments
Information & Contributors
Information
Published In
Sponsors
- BytePress
- Concordia University: Concordia University
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Research-article
Conference
- Concordia University
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 115Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in