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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Algorithms for listing the subgraphs satisfying a given property (e.g.,beinga clique, a cut, a cycle, etc.) fall within the general framework of setsystems. A set system (U, F) uses a ground set U (e.g., the network nodes) andan indicator F, subset of 2^U, of which subsets of U have the requiredproperty. For the problem of listing all sets in F maximal under inclusion, theambitious goal is to cover a large class of set systems, preserving at the sametime the efficiency of the enumeration. Among the existing algorithms, thebest-known ones list the maximal subsets in time proportional to their numberbut may require exponential space. In this paper we improve the state of theart in two directions by introducing an algorithmic framework that, understandard suitable conditions, simultaneously (i) extends the class of problemsthat can be solved efficiently to strongly accessible set systems, and (ii)reduces the additional space usage from exponential in |U| to stateless, thusaccounting for just O(q) space, where q <= |U| is the largest size of a maximalset in F

Listing Maximal Subgraphs in Strongly Accessible Set Systems