48 citations · 56 across the 2 of their papers we have counts for
2 papers
physics.soc-ph2009★ 48 cited
Maximizing Influence Propagation in Networks with Community Structure
Aram Galstyan, Vahe Musoyan, Paul Cohen
We consider the algorithmic problem of selecting a set of target nodes that cause the biggest activation cascade in a network. In case when the activation process obeys the diminis…
cs.DM2007★ 8 cited
On Edge-Disjoint Pairs Of Matchings
V. V. Mkrtchyan, V. L. Musoyan, A. V. Tserunyan
For a graph G, consider the pairs of edge-disjoint matchings whose union consists of as many edges as possible. Let H be the largest matching among such pairs. Let M be a maximum m…