Zobrazeno 1 - 10
of 69
pro vyhledávání: '"Soltani, Hossein"'
Let $G$ be a graph, which represents a social network, and suppose each node $v$ has a threshold value $\tau(v)$. Consider an initial configuration, where each node is either positive or negative. In each discrete time step, a node $v$ becomes/remain
Externí odkaz:
http://arxiv.org/abs/2307.09111
Autor:
HOSSEINZADEH, SAMANEH1 s.hoseinzadeh6571@gmail.com, SOLTANI, HOSSEIN1 h.soltani@uut.ac.ir
Publikováno v:
Transactions on Combinatorics. Summer2024, Vol. 13 Issue 2, p143-152. 10p.
Publikováno v:
In Journal of Energy Storage February 2023 58
Autor:
Soltani, Hossein, Zaker, Manouchehr
Publikováno v:
Utilitas Mathematica, Vol. 106 (2018)
Let $G$ be a graph and $\tau$ be an assignment of nonnegative integer thresholds to the vertices of $G$. Denote the average of thresholds in $\tau$ by $\bar{\tau}$. A subset of vertices $D$ is said to be a $\tau$-dynamic monopoly, if $V(G)$ can be pa
Externí odkaz:
http://arxiv.org/abs/1806.02770
Publikováno v:
In Journal of Cleaner Production 10 January 2022 331
Publikováno v:
In International Journal of Heat and Mass Transfer November 2021 179
Let $G$ be a directed graph such that the in-degree of any vertex $G$ is at least one. Let also ${\mathcal{\tau}}: V(G)\rightarrow \Bbb{N}$ be an assignment of thresholds to the vertices of $G$. A subset $M$ of vertices of $G$ is called a dynamic mon
Externí odkaz:
http://arxiv.org/abs/1212.3682
Let $G$ be a graph and ${\mathcal{\tau}}: V(G)\rightarrow \Bbb{N}\cup \{0\}$ be an assignment of thresholds to the vertices of $G$. A subset of vertices $D$ is said to be a dynamic monopoly corresponding to $(G, \tau)$ if the vertices of $G$ can be p
Externí odkaz:
http://arxiv.org/abs/1202.1146
Autor:
Soltani, Hossein, Agarwal, Kuldeep
Publikováno v:
IEOM African Conference Proceedings; 4/23/2024, p809-819, 11p