5 citations · 5 across the 1 of their papers we have counts for
1 paper
Arindam Khan, Prasad Raghavendra, Prasad Tetali +1
Given a capacitated undirected graph G=(V,E) with a set of terminals K⊂V, a mimicking network is a smaller graph H=(VH,EH) that exactly preserves all the minimum cu…