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

In this paper, we are interested in algorithms that take in input anarbitrary graph $G$, and that enumerate in output all the (inclusion-wise)maximal "subgraphs" of $G$ which fulfil a given property $\Pi$. All over thispaper, we study several different properties $\Pi$, and the notion of subgraphunder consideration (induced or not) will vary from a result to another.  More precisely, we present efficient algorithms to list all maximal splitsubgraphs, sub-cographs and some subclasses of cographs of a given input graph.All the algorithms presented here run in polynomial delay, and moreover forsplit graphs it only requires polynomial space. In order to develop analgorithm for maximal split (edge-)subgraphs, we establish a bijection betweenthe maximal split subgraphs and the maximal independent sets of an auxiliarygraph. For cographs and some subclasses , the algorithms rely on a frameworkrecently introduced by Conte & Uno called Proximity Search. Finally we considerthe extension problem, which consists in deciding if there exists a maximalinduced subgraph satisfying a property $\Pi$ that contains a set of prescribedvertices and that avoids another set of vertices. We show that this problem isNP-complete for every "interesting" hereditary property $\Pi$. We extend thehardness result to some specific edge version of the extension problem.

Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes