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 graphs $G$ and $H$, we propose a method to implicitly enumeratetopological-minor-embeddings of $H$ in $G$ using decision diagrams. We show auseful application of our method to enumerating subgraphs characterized byforbidden topological minors, that is, planar, outerplanar, series-parallel,and cactus subgraphs. Computational experiments show that our method can findall planar subgraphs in a given graph at most five orders of magnitude fasterthan a naive backtracking-based method.

Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration