DeepAI AI Chat
Log In Sign Up

Some Preliminary Result About the Inset Edge and Average Distance of Trees

by   M. H. Khalifeh, et al.

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 of the problem is polynomial. In this paper, some tools for a precise analysis of the problem for the trees are established. Using the tools, we can avoid using the distance matrix. This leads to more efficient algorithms and a better analysis of the problem. Several applications of the tools as well as a tight bound for the change of average distance when an inset edge is added to a tree are presented.


page 1

page 2

page 3

page 4


Inset Edges Effect and Average Distance of Trees

An added edge to a graph is called an inset edge. Predicting k inset edg...

A Note on the Flip Distance Problem for Edge-Labeled Triangulations

For both triangulations of point sets and simple polygons, it is known t...

FPT-algorithms for computing Gromov-Hausdorff and interleaving distances between trees

Gromov-Hausdorff (GH) distance is a natural way to measure the distortio...

Computing nearest neighbour interchange distances between ranked phylogenetic trees

Many popular algorithms for searching the space of leaf-labelled trees a...

Efficient Stepwise Selection in Decomposable Models

In this paper, we present an efficient way of performing stepwise select...

Perfect Edge-Transmitting Recombination of Permutations

Crossover is the process of recombining the genetic features of two pare...

Computing Consensus Curves

We consider the problem of extracting accurate average ant trajectories ...