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/

Zendy Plus

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

Zendy Tools

Zendy Open

Given a graph $G$ and sets $\{\alpha_v~|~v \in V(G)\}$ and $\{\beta_v~|~v \inV(G)\}$ of non-negative integers, it is known that the decision problem whether$G$ contains a spanning tree $T$ such that $\alpha_v \le d_T (v) \le \beta_v $for all $v \in V(G)$ is $NP$-complete. In this article, we relax the problem bydemanding that the degree restrictions apply to vertices $v\in U$ only, where$U$ is a stable set of $G$. In this case, the problem becomes tractable.  A. Frank presented a result characterizing the positive instances of thatrelaxed problem. Using matroid intersection developed by J. Edmonds, we give anew and short proof of Frank's result and show that if $U$ is stable and theedges of $G$ are weighted by arbitrary real numbers, then even a minimum-costtree $T$ with $\alpha_v \le d_T (v) \le \beta_v $ for all $v \in U$ can befound in polynomial time if such a tree exists.

Minimum Spanning Trees with Bounded Degrees of Vertices in a Specified Stable Set