2 citations · 3 across the 8 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DM2014
On finding orientations with fewest number of vartices with small out-degree
Kaveh Khoshkhah
Given an undirected graph, each of the two end-vertices of an edge can own the edge. Call a vertex poor, if it owns at most one edge. We give a polynomial time algorithm for the pr…
math.CO2014
On the largest dynamic monopolies of graphs with a given average threshold
Kaveh Khoshkhah, Manouchehr Zaker
Let be a graph and be an assignment of nonnegative integer thresholds to the vertices of . A subset of vertices is said to be a -dynamic monopoly, if can b…