9 citations · 27 across the 13 of their papers we have counts for
4 papers · 1 filter
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…