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 graph G and a query vertex q, the topic of community search (CS),aiming to retrieve a dense subgraph of G containing q, has gained muchattention. Most existing works focus on undirected graphs which overlooks therich information carried by the edge directions. Recently, the problem ofcommunity search over directed graphs (or CSD problem) has been studied; itfinds a connected subgraph containing q, where the in-degree and out-degree ofeach vertex within the subgraph are at least k and l, respectively. However,existing solutions are inefficient, especially on large graphs. To tackle thisissue, in this paper, we propose a novel index called D-Forest, which allows aCSD query to be completed within the optimal time cost. We further proposeefficient index construction methods. Extensive experiments on six real largegraphs show that our index-based query algorithm is up to two orders ofmagnitude faster than existing solutions.

An Augmented Index-based Efficient Community Search for Large Directed Graphs