3 papers
math.NA2011
A load balancing strategy for parallel computation of sparse permanents
Lei Wang, Heng Liang, Fengshan Bai +1
The research in parallel machine scheduling in combinatorial optimization suggests that the desirable parallel efficiency could be achieved when the jobs are sorted in the non-incr…
cs.GR2008
An analysis of a random algorithm for estimating all the matchings
Jinshan Zhang
Counting the number of all the matchings on a bipartite graph has been transformed into calculating the permanent of a matrix obtained from the extended bipartite graph by Yan Huo,…
cs.CC2007
An analysis of a random algorithm for estimating all the matchings
Jinshan Zhang, Yan Huo, Fengshan Bai
Counting the number of all the matchings on a bipartite graph has been transformed into calculating the permanent of a matrix obtained from the extended bipartite graph by Yan Huo,…