Suchergebnisse - "ACM: G.: Mathematics of Computing"

Exact values for three domination-like problems in circular and infinite grid graphs of small height von Bouznif, Marwane, Darlay, Julien, Moncel, Julien, Preissmann, Myriam

“… In this paper we study three domination-like problems, namely identifying codes, locating-dominating codes, and locating-total-dominating codes. We are …”
Volltext

Safe sets, network majority on weighted trees von Bapat, Ravindra B., Fujita, Shinya, Legay, Sylvain, Manoussakis, Yannis, Matsui, Yasuko, Sakuma, Tadashi, Tuza, Zsolt

“… Let G=(V,E) be a graph and let w:V→ℝ>0 be a positive weight function on the vertices of G. For every subset X of V, let w(X):=∑v∈Gw(v). A non‐empty subset …”
Volltext

Network Majority on Tree Topological Network von Bapat, Ravindra B., Fujita, Shinya, Legay, Sylvain, Manoussakis, Yannis, Matsui, Yasuko, Sakuma, Tadashi, Tuza, Zsolt

“… Let G=(V,E) be a graph, and w:V→Q>0 be a positive weight function on the vertices of G. For every subset X of V, let w(X)=∑v∈Gw(v). A non-empty subset S⊂V(G) …”
Volltext