66 citations · 323 across the 55 of their papers we have counts for
4 papers · 1 filter
New Polynomial Cases of the Weighted Efficient Domination Problem
Andreas Brandstädt, Martin Milanic, Ragnar Nevries
Let G be a finite undirected graph. A vertex dominates itself and all its neighbors in G. A vertex set D is an efficient dominating set (e.d. for short) of G if every vertex of G i…
Latency-Bounded Target Set Selection in Social Networks
Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano +2
Motivated by applications in sociology, economy and medicine, we study variants of the Target Set Selection problem, first proposed by Kempe, Kleinberg and Tardos. In our scenario…
Total Domishold Graphs: a Generalization of Threshold Graphs, with Connections to Threshold Hypergraphs
Nina Chiarelli, Martin Milanic
A total dominating set in a graph is a set of vertices such that every vertex of the graph has a neighbor in the set. We introduce and study graphs that admit non-negative real wei…
On CIS Circulants
Endre Boros, Vladimir Gurvich, Martin Milanic
A circulant is a Cayley graph over a cyclic group. A well-covered graph is a graph in which all maximal stable sets are of the same size, or in other words, they are all maximum. A…