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

We introduce a new type of fully computable problems, for DSS dedicated tomaximal spanning tree problems, based on deduction and choice: preferentialconsistency problems. To show its interest, we describe a new compactrepresentation of preferences specific to spanning trees, identifying anefficient maximal spanning tree sub-problem. Next, we compare this problem withthe Pareto-based multiobjective one. And at last, we propose an efficientalgorithm solving the associated preferential consistency problem.

Global preferential consistency for the topological sorting-based maximal spanning tree problem