2 papers
cs.CC2020
Some Preliminary Result About the Inset Edge and Average Distance of Trees
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…
cs.DS2020
Inset Edges Effect and Average Distance of Trees
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. When k = 1 the complexity of the p…