9 citations · 36 across the 21 of their papers we have counts for
21 papers
Computing a many-to-many matching with demands and capacities between two sets using the Hungarian algorithm
Fatemeh Rajabi-Alni, Alireza Bagheri
Given two sets A={a_1,a_2,...,a_s} and {b_1,b_2,...,b_t}, a many-to-many matching with demands and capacities (MMDC) between A and B matches each element a_i in A to at least α_i a…
Apply Sorting Algorithms to FAST Problem
Sadra Mohammadshirazi, Alireza Bagheri
FAST problem is finding minimum feedback arc set problem in tournaments. In this paper we present some algorithms that are similar to sorting algorithms for FAST problem and we ana…
Efficient Many-To-Many Matching of Points with Demands in One Dimension
Fatemeh Rajabi-Alni, Behrouz Minaei-Bidgoli
Given two point sets and , the minimum-cost many-to-many matching with demands (MMD) problem is the problem of finding a minimum-cost many-to-many matching between and $…
A faster algorithm for the limited-capacity many-to-many point matching in one dimension
Fatemeh Rajabi-Alni, Alireza Bagheri, Behrouz Minaei-Bidgoli
Given two sets S and T, a limited-capacity many-to-many matching (LCMM) between S and T matches each element p in S (resp. T) to at least 1 and at most Cap(p) elements in T (resp.…
Weighted Label Propagation Algorithm based on Local Edge Betweenness
Hamid Shahrivari Joghan, Alireza Bagheri, Meysam Azad
In complex networks, especially social networks, networks could be divided into disjoint partitions that the ratio between the number of internal edges (the edges between the verti…
A New Optimal Algorithm for Computing the Visibility Area of a simple Polygon from a Viewpoint
Hamid Hoorfar, Alireza Bagheri
Given a simple polygon of vertices in the Plane. We study the problem of computing the visibility area from a given viewpoint inside w…