Shimon Kogan

activity

20172026

most citedTarget Set Selection for Conservative Populations

3 citations · 8 across the 9 of their papers we have counts for

collaborators

Showing 2019Show all

2 papers · 1 filter

math.CO2019★ 1 cited

New results on large induced forests in graphs

Shimon Kogan

For a graph $G$ , let $a (G)$ denote the maximum size of a subset of vertices that induces a forest. We prove the following. 1. Let $G$ be a graph of order $n$ , maximum degree $Δ > 0$ …

cs.DS2019★ 3 cited

Target Set Selection for Conservative Populations

Uriel Feige, Shimon Kogan

Let $G = (V, E)$ be a graph on $n$ vertices, where $d_{v}$ denotes the degree of vertex $v$ , and $t_{v}$ is a threshold associated with $v$ . We consider a process in which initially a s…