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

The modular decomposition of a graph $G$ is a natural construction to capturekey features of $G$ in terms of a labeled tree $(T,t)$ whose vertices arelabeled as "series" ($1$), "parallel" ($0$) or "prime". However, fullinformation of $G$ is provided by its modular decomposition tree $(T,t)$ only,if $G$ does not contain prime modules. In this case, $(T,t)$ explains $G$,i.e., $\{x,y\}\in E(G)$ if and only if the lowest common ancestor$\mathrm{lca}_T(x,y)$ of $x$ and $y$ has label "$1$". This information,however, gets lost whenever $(T,t)$ contains vertices with label "prime". Inthis contribution, we aim at replacing "prime" vertices in $(T,t)$ by simple0/1-labeled cycles, which leads to the concept of rooted labeled level-1networks $(N,t)$.  We characterize graphs that can be explained by such level-1 networks$(N,t)$, which generalizes the concept of graphs that can be explained bylabeled trees, that is, cographs. We provide three novel graph classes:\emph{polar-cats} are a proper subclass of \emph{pseudo-cographs} which forms aproper subclass of \emph{prime polar-cats}. In particular, every cograph is apseudo-cograph and prime polar-cats are precisely those graphs that can beexplained by a labeled level-1 network. The class of prime polar-cats isdefined in terms of the modular decomposition of graphs and the property thatall prime modules "induce" polar-cats. We provide a plethora of structuralresults and characterizations for graphs of these new classes. In addition, weshow under which conditions there is a unique least-resolved labeled level-1network that explains a given graph and provide linear-time algorithms torecognize all these types of graphs and to construct level-1 networks toexplain them.

From Modular Decomposition Trees to Level-1 Networks: Pseudo-Cographs, Polar-Cats and Prime Polar-Cats