English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Given a directed graph and a node <inline-formula> <tex-math notation="LaTeX">$v$ </tex-math></inline-formula>, the transitive closure (<italic>TC</italic>) of <inline-formula> <tex-math notation="LaTeX">$v$ </tex-math></inline-formula> is the set of nodes that <inline-formula> <tex-math notation="LaTeX">$v$ </tex-math></inline-formula> can reach in the graph. <italic>TC</italic> size is very important in many applications but the cost of <italic>TC</italic> size computation is high in both time and space, which makes computing accurate <italic>TC</italic> size not applicable to the scenario where we need to know the <italic>TC</italic> size quickly for large graphs. Considering that existing approaches are either inefficient or inaccurate, we propose an algorithm, namely <italic>buTCS</italic>, to efficiently make more accurate estimation. Our approach works in linear time and space. The basic idea is to compute a node&#x2019;s <italic>TC</italic> size based on that of its out-neighbors and perform a top-down verification. We further propose two optimizations to improve the estimation accuracy. The experimental results on 13 real datasets show that <italic>buTCS</italic> achieves better estimation on <italic>TC</italic> size efficiently.

buTCS: An Optimized Algorithm for Estimating the Size of Transitive Closure