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

For a positive integer $r$, a distance-$r$ independent set in an undirectedgraph $G$ is a set $I\subseteq V(G)$ of vertices pairwise at distance greaterthan $r$, while a distance-$r$ dominating set is a set $D\subseteq V(G)$ suchthat every vertex of the graph is within distance at most $r$ from a vertexfrom $D$. We study the duality between the maximum size of a distance-$2r$independent set and the minimum size of a distance-$r$ dominating set innowhere dense graph classes, as well as the kernelization complexity of thedistance-$r$ independent set problem on these graph classes. Specifically, weprove that the distance-$r$ independent set problem admits an almost linearkernel on every nowhere dense graph class.

Kernelization and approximation of distance-$r$ independent sets on nowhere dense graphs