Márcia R. Cappelle

activity

20152021

collaborators

4 papers

cs.DM2021

Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs

Márcia R. Cappelle, Erika Coelho, Les R. Foulds +1

Let $G = (V (G), E (G))$ be a finite simple undirected graph with vertex set $V (G)$ , edge set $E (G)$ and vertex subset $S \subseteq V (G)$ . $S$ is termed \emph{open-dominating} if every v…

cs.DS2020

Parameterized algorithms for locating-dominating sets

Márcia R. Cappelle, Guilherme C. M. Gomes, Vinicius F. dos Santos

A locating-dominating set $D$ of a graph $G$ is a dominating set of $G$ where each vertex not in $D$ has a unique neighborhood in $D$ , and the Locating-Dominating Set problem asks…

cs.DS2017

A note on searching sorted unbalanced three-dimensional arrays

Márcia R. Cappelle, Les Foulds, Humberto J. Longo

We examine the problem of searching sequentially for a desired real value (a key) within a sorted unbalanced three-dimensional finite real array. This classic problem can be viewed…

math.CO2015

Identifying Codes in the Complementary Prism of Cycles

Marcia R. Cappelle, Erika M. M. Coelho, Hebert Coelho +2

We show that an identifying code of minimum order in the complementary prism of a cycle of order $n$ has order $7 n /9 + Θ (1)$ . Furthermore, we observe that the clique-width of the com…