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

The Vertex Separator Problem (VSP) on a graph is the problem of finding thesmallest collection of vertices whose removal separates the graph into twodisjoint subsets of roughly equal size. Recently, Hager and Hungerford [1]developed a continuous bilinear programming formulation of the VSP. In thispaper, we reinforce the bilinear programming approach with a multilevel schemefor learning the structure of the graph.

A Continuous Refinement Strategy for the Multilevel Computation of Vertex Separators