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

In this paper we study lift-and-project polyhedral operators defined byLov?asz and Schrijver and Balas, Ceria and Cornu?ejols on the clique relaxationof the stable set polytope of web graphs. We compute the disjunctive rank ofall webs and consequently of antiweb graphs. We also obtain the disjunctiverank of the antiweb constraints for which the complexity of the separationproblem is still unknown. Finally, we use our results to provide bounds of thedisjunctive rank of larger classes of graphs as joined a-perfect graphs, wherenear-bipartite graphs belong.

Lift-and-project ranks of the stable set polytope of joined a-perfect graphs