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 minimum directed feedback vertex set problem consists in finding theminimum set of vertices that should be removed in order to make a directedgraph acyclic. This is a well-known NP-hard optimization problem withapplications in various fields, such as VLSI chip design, bioinformatics andtransaction processing deadlock prevention and node-weighted network design. Weshow a constant factor approximation for the directed feedback vertex setproblem in graphs of bounded genus.

A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus