Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Mohammad Mehdi Daliri Khomami"'
Publikováno v:
Results in Engineering, Vol 24, Iss , Pp 103224- (2024)
Investigating the maximum independent set in stochastic multilayer graphs provides critical insights into the structural and dynamical properties of complex networks. Recently, stochastic multilayer graphs effectively model the intricate interactions
Externí odkaz:
https://doaj.org/article/d508a5ed0fee4b44a8dca91a7d5bafcb
Publikováno v:
Journal of Computational Design and Engineering. 9:966-991
The goore game (GG) is a model for collective decision making under uncertainty, which can be used as a tool for stochastic optimization of a discrete variable function. The GG has a fascinating property that can be resolved in a distributed manner w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f59df698f336c8a4f0ed51f49f358a30
https://doi.org/10.1093/jcde/qwac010
https://doi.org/10.1093/jcde/qwac010
Publikováno v:
The Journal of Supercomputing. 78:15181-15228
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7e6723eafdc033302d1fb924e9f0480f
https://doi.org/10.1007/s11227-022-04435-1
https://doi.org/10.1007/s11227-022-04435-1
Publikováno v:
The Journal of Supercomputing. 77:2207-2236
Influence maximization (IM) problem, a fundamental algorithmic problem, is the problem of selecting a set of k users (refer as seed set) from a social network to maximize the expected number of influenced users (also known as influence spread). Due t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ce910c3149ad65364f07edae8da92047
https://doi.org/10.1007/s11227-020-03355-2
https://doi.org/10.1007/s11227-020-03355-2
Autor:
Mohammad Mehdi Daliri Khomami, Alireza Rezvanian, Mohammad Reza Meybodi, Ali Mohammad Saghiri
Publikováno v:
CSICC
The dominating set (DS) problem has noticed the selecting a subset of vertices that every vertex in the graph is either is adjacent to one or more nodes of this subset. The DS with the minimum cardinality is called MDS (minimum dominating set). The M
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0c8bae6e2050d382ea549fdd6f5eea5f
https://doi.org/10.1109/csicc52343.2021.9420625
https://doi.org/10.1109/csicc52343.2021.9420625
Autor:
Alireza Rezvanian, Mohammad Reza Meybodi, Ali Mohammad Saghiri, Mohammad Mehdi Daliri Khomami
Publikováno v:
2020 11th International Conference on Information and Knowledge Technology (IKT).
Maximal clique finding is a fundamental problem in graph theory and has been broadly investigated. However, maximal clique finding is time-consuming due to its nature and always returns tremendous cliques with large overlap nodes. Hence, a solution u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e3c1c8862e621fa9136a8051cd6a0023
https://doi.org/10.1109/ikt51791.2020.9345622
https://doi.org/10.1109/ikt51791.2020.9345622
Autor:
Ali Mohammad Saghiri, Alireza Rezvanian, Mohammad Reza Meybodi, Mohammad Mehdi Daliri Khomami
Publikováno v:
2020 8th Iranian Joint Congress on Fuzzy and intelligent Systems (CFIS).
Detecting community, as the fundamental task for the study of the network, reveals a hopeful approach to investigating the functional and topological properties of real networks. Recently, several algorithms for detecting community have been introduc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2d623979bfa2a90a0ae73937823284f0
https://doi.org/10.1109/cfis49607.2020.9238676
https://doi.org/10.1109/cfis49607.2020.9238676
Autor:
Alireza Rezvanian, Mohammad Reza Meybodi, Ali Mohammad Saghiri, Mohammad Mehdi Daliri Khomami
Publikováno v:
2020 28th Iranian Conference on Electrical Engineering (ICEE).
The community detection problem in social networks has been broadly explored from different aspects. In this problem, it is attempted to divide a network into a group-set of similar nodes (communities), in which nodes inside a community structure ref
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ce2bade187f4db2982802f928fbbb475
https://doi.org/10.1109/icee50131.2020.9260792
https://doi.org/10.1109/icee50131.2020.9260792
Autor:
Ali Mohammad Saghiri, Mohammad Mehdi Daliri Khomami, Mohammad Reza Meybodi, Alireza Rezvanian
Publikováno v:
2020 6th International Conference on Web Research (ICWR).
The tremendous increase in Web usage led to the appearance of different network structures. One of the essential issues in the field of network science and engineering is to find and utilize network structures such as community structures by communit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5c3fc5ebea4c1507556b60cbc813bb08
https://doi.org/10.1109/icwr49608.2020.9122290
https://doi.org/10.1109/icwr49608.2020.9122290
Publikováno v:
Journal of Computational Science. 24:413-426
Community structure is one of the common and fundamental characteristics of many real-world networks such as information and social networks. The structure, function, evolution and dynamics of complex social networks can be explored through detecting
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6bb8417aecb65acbbe7456aefa0cd10e
https://doi.org/10.1016/j.jocs.2017.10.009
https://doi.org/10.1016/j.jocs.2017.10.009