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

A weak dominance drawing $\Gamma$ of a DAG $G=(V,E)$, is a $d$-dimensionaldrawing such that there is a directed path from a vertex $u$ to a vertex $v$ in$G$ if $D(u) <D(v)$ for every dimension $D$ of $\Gamma$. We have a\emph{falsely implied path (fip)} when $D(u) < D(v)$ for every dimension $D$of~$\Gamma$, but there is no path from $u$ to $v$. Minimizing the number offips is an important theoretical and practical problem, which is NP-hard. Weshow that it is an FPT~problem for parameter $k$, where $k$ is the maximumdegree of a vertex of the \emph{modular~decomposition~tree} of~$G$. Namely, forany constant $d$, we present an $O(nm+ndk^2(k!)^d)$ time algorithm to compute aweak $d$-dimensional dominance drawing $\Gamma$ of a DAG $G$ having the minimumnumber of fips. An interesting implication of this result is that we can decideif a DAG has dominance dimension~$3$ (a well-known NP-complete problem) in time$O(nm+nk^2(k!)^3)$.

Computing Weak Dominance Drawings with Minimum Number of Fips