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

Due to their importance in practice, dominating set problems in graphs havebeen greatly studied in past and different formulations of these problems arepresented in literature. This paper's focus is on two problems: weakly convexdominating set problem (WCVXDSP) and convex dominating set problem (CVXDSP). Itintroduces two integer linear programming (ILP) formulation for CVXDSP and oneILP mode for WCVXDSP, as well as proof for equivalency between ILP models forCVXDSP. The proof of correctness for all introduced ILP formulations isprovided by showing that optimal solution to the each ILP formulation is equalto the optimal solution of the original problem.

An Integer Linear Programming Formulation for the Convex Dominating Set Problems