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 three domination-like problems, namely identifyingcodes, locating-dominating codes, and locating-total-dominating codes. We areinterested in finding the minimum cardinality of such codes in circular andinfinite grid graphs of given height. We provide an alternate proof for alreadyknown results, as well as new results. These were obtained by a computer searchbased on a generic framework, that we developed earlier, for the search of aminimum labeling satisfying a pseudo-d-local property in rotagraphs.

Exact values for three domination-like problems in circular and infinite grid graphs of small height