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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

The Near-Bipartiteness problem is that of deciding whether or not thevertices of a graph can be partitioned into sets $A$ and $B$, where $A$ is anindependent set and $B$ induces a forest. The set $A$ in such a partition issaid to be an independent feedback vertex set. Yang and Yuan proved thatNear-Bipartiteness is polynomial-time solvable for graphs of diameter 2 andNP-complete for graphs of diameter 4. We show that Near-Bipartiteness isNP-complete for graphs of diameter 3, resolving their open problem. We alsogeneralise their result for diameter 2 by proving that even the problem ofcomputing a minimum independent feedback vertex is polynomial-time solvable forgraphs of diameter 2.

Independent Feedback Vertex Sets for Graphs of Bounded Diameter