2 citations · 3 across the 8 of their papers we have counts for
1 paper · 2 filters
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…