Asset Details

MbrlCatalogueTitleDetail

Do you wish to reserve the book?

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

by Preissmann, Myriam , Moncel, Julien , Darlay, Julien , Bouznif, Marwane

in [info.info-dm]computer science [cs]/discrete mathematics [cs.dm] / acm: g.: mathematics of computing/g.2: discrete mathematics/g.2.2: graph theory / acm: g.: mathematics of computing/g.2: discrete mathematics/g.2.2: graph theory/g.2.2.0: graph algorithms / acm: g.: mathematics of computing/g.2: discrete mathematics/g.2.2: graph theory/g.2.2.1: graph labeling / acm: g.: mathematics of computing/g.2: discrete mathematics/g.2.2: graph theory/g.2.2.4: path and circuit problems / Codes / Computer Science / Discrete Mathematics / graph algorithm / Graphs / grid / identifying code / locating-dominating code / locating-total-dominating code

2019

Yes Please

Hey, we have placed the reservation for you!

By the way, why not check out events that you can attend while you pick your title.

Oops! Something went wrong.

Looks like we were not able to place the reservation. Kindly try again later.

Are you sure you want to remove the book from the shelf?

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

by Preissmann, Myriam , Moncel, Julien , Darlay, Julien , Bouznif, Marwane

2019

Confirm

Do you wish to request the book?

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

by Preissmann, Myriam , Moncel, Julien , Darlay, Julien , Bouznif, Marwane

2019

Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy

How would you like to get it?

Submit

We have requested the book for you!

Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.

Oops! Something went wrong.

Looks like we were not able to place your request. Kindly try again later.

Journal Article

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

Preissmann, Myriam,

Moncel, Julien,

Darlay, Julien,

Bouznif, Marwane

2019

Overview

In this paper we study three domination-like problems, namely identifying codes, locating-dominating codes, and locating-total-dominating codes. We are interested in finding the minimum cardinality of such codes in circular and infinite grid graphs of given height. We provide an alternate proof for already known results, as well as new results. These were obtained by a computer search based on a generic framework, that we developed earlier, for the search of a minimum labeling satisfying a pseudo-d-local property in rotagraphs.

Share this book

Add to My Shelf

Publisher

DMTCS,Discrete Mathematics & Theoretical Computer Science

Subject

[info.info-dm]computer science [cs]/discrete mathematics [cs.dm]

/ acm: g.: mathematics of computing/g.2: discrete mathematics/g.2.2: graph theory

/ acm: g.: mathematics of computing/g.2: discrete mathematics/g.2.2: graph theory/g.2.2.0: graph algorithms

/ acm: g.: mathematics of computing/g.2: discrete mathematics/g.2.2: graph theory/g.2.2.1: graph labeling

/ acm: g.: mathematics of computing/g.2: discrete mathematics/g.2.2: graph theory/g.2.2.4: path and circuit problems

/ Codes

/ Computer Science