2 citations · 3 across the 5 of their papers we have counts for
1 paper · 1 filter
M. H. Khalifeh, A. -H. Esfahanian
An added edge to a graph is called an inset edge. Predicting k inset edges which minimize the average distance of a graph is known to be NP-Hard. However, when k = 1 the complexity…