9 citations · 27 across the 13 of their papers we have counts for
6 papers · 1 filter
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…
An approximation algorithm for the longest cycle problem in solid grid graphs
Asghar Asgharian Sardroud, Alireza Bagheri
Although, the Hamiltonicity of solid grid graphs are polynomial-time decidable, the complexity of the longest cycle problem in these graphs is still open. In this paper, by present…
A new algorithm for Many to Many Matching with Demands and Capacities
Fatemeh Rajabi-Alni
Let A={a_1,a_2,...,a_s} and {b_1,b_2,...,b_t} with s+r=n, the many to many point matching with demands and capacities matches each point a_i in A to at least alpha_i and at most al…
Many to Many Matching with Demands and Capacities
Fatemeh Rajabi-Alni, Alireza Bagheri
Let A and B be two finite sets of points with total cardinality n, the many to many point matching with demands and capacities matches each point ai in A to at least alpha'i and at…
Hamiltonian Paths in Two Classes of Grid Graphs
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
In this paper, we give the necessary and sufficient conditions for the existence of Hamiltonian paths in alphabet and alphabet grid graphs. We also present a linear-time al…