30 citations · 56 across the 10 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2008★ 4 cited
On the graph isomorphism problem
Shmuel Friedland
We relate the graph isomorphism problem to the solvability of certain systems of linear equations with nonnegative variables. This version replaces the two previous versions of thi…
cs.CC2007★ 2 cited
FPRAS for computing a lower bound for weighted matching polynomial of graphs
Shmuel Friedland
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching polyn…