2 citations · 7 across the 11 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.CO2015
Best and worst case permutations for random online domination of the path
Christopher Coscia, Jonathan DeWitt, Fan Yang +1
We study a randomized algorithm for graph domination, by which, according to a uniformly chosen permutation, vertices are revealed and added to the dominating set if not already do…
math.CO2015★ 1 cited
Nowhere-zero 9-flows in 3-edge-connected signed graphs
Fan Yang, Sanming Zhou
A signed graph is a graph with a positive or negative sign on each edge. Regarding each edge as two half edges, an orientation of a signed graph is an assignment of a direction to…