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

An abundance of real-world problems manifest as covering edges and/orvertices of a graph with cliques that are optimized for some objectives. Weconsider different structural parameters of graph, and design fixed-parametertractable algorithms for a number of clique cover problems. Using a setrepresentation of graph, we introduce a framework for computing clique coverwith different objectives. We demonstrate use of the framework for a variety ofclique cover problems. Our results include a number of new algorithms withexponential to double exponential improvements in the running time.

Computing Clique Cover with Structural Parameterization