Zobrazeno 1 - 10
of 170
pro vyhledávání: '"Moradi, Ehsan"'
The burning process on a graph $G$ starts with a single burnt vertex, and at each subsequent step, burns the neighbors of the currently burnt vertices, as well as one other unburnt vertex. The burning number of $G$ is the smallest number of steps req
Externí odkaz:
http://arxiv.org/abs/2205.04643
Publikováno v:
In Heliyon 15 August 2024 10(15)
Publikováno v:
In Interdisciplinary Neurosurgery: Advanced Techniques and Case Management June 2024 36
Publikováno v:
In Interdisciplinary Neurosurgery: Advanced Techniques and Case Management June 2024 36
Autor:
Far, Hossein Shahriyari, Najafi, Mina, Moradi, Ehsan, Atighi, Milad, Rabbani, Mahboubeh, Hasanzadeh, Mahdi
Publikováno v:
In Journal of Molecular Structure 15 September 2024 1312 Part 1
Autor:
Moradi, Ehsan, Mondal, Debajyoti
Graph layouts are key to exploring massive graphs. An enormous number of nodes and edges do not allow network analysis software to produce meaningful visualization of the pervasive networks. Long computation time, memory and display limitations encir
Externí odkaz:
http://arxiv.org/abs/2108.00529
A grounded 1-bend string graph is an intersection graph of a set of polygonal lines, each with one bend, such that the lines lie above a common horizontal line $\ell$ and have exactly one endpoint on $\ell$. We show that the problem of finding a maxi
Externí odkaz:
http://arxiv.org/abs/2107.05198
Publikováno v:
In Journal of Environmental Management 27 February 2024 353
Publikováno v:
In World Neurosurgery: X July 2023 19