Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Mehdy Roayaei"'
Publikováno v:
IEEE Transactions on Computational Social Systems. :1-9
Autor:
Mehdy Roayaei
Publikováno v:
Soft Computing. 25:14715-14728
Grey Wolf Optimizer (GWO) is a nature-inspired swarm intelligence algorithm that mimics the hunting behavior of grey wolves. GWO, in its basic form, is a real coded algorithm that needs modifications to deal with binary optimization problems. In this
Autor:
Mehdy Roayaei, Mohammadreza Razzazi
Publikováno v:
International Journal of Foundations of Computer Science. 29:1215-1230
We consider the directed Steiner network problem, where given a weighted directed graph [Formula: see text] and [Formula: see text] pairs of vertices [Formula: see text], one has to find the minimum weight subgraph [Formula: see text] of [Formula: se
Autor:
Mehdy Roayaei, Mohammadreza Razzazi
Publikováno v:
Fundamenta Informaticae. 160:447-463
Autor:
Mehdy Roayaei
Publikováno v:
Network Modeling Analysis in Health Informatics and Bioinformatics. 8
We consider the following problem: given an undirected (mixed) network and a set of ordered source–target pairs, or cause–effect pairs, direct all edges so as to maximize the number of pairs that admit a directed source–target path. This is cal
Autor:
Mohammadreza Razzazi, Mehdy Roayaei
Publikováno v:
Information Processing Letters. 116:590-594
In this paper, we study the problem of modifying a graph such that the resulting graph has a dominating set of size at most k. Solving this problem determines the minimum number of edges to be added to a given graph such that at most k vertices can d
Autor:
Mehdy Roayaei, Mohammadreza Razzazi
Publikováno v:
Journal of Combinatorial Optimization. 33:1030-1056
We consider an augmentation problem on undirected and directed graphs, where given a directed (an undirected) graph G and p pairs of vertices $$P=\left\{ {\left( {s_1 ,t_1 } \right) ,\ldots ,\left( {s_p ,t_p } \right) } \right\} $$P=s1,t1,ź,sp,tp, o