An Efficient Algorithm for Computation of a Minimum Average Distance Tree on Trapezoid Graphs
نویسندگان
چکیده
منابع مشابه
Computation of a Tree 3-Spanner on Trapezoid Graphs
In a graph G , a spanning tree T is said to be a tree t-spanner of the graph G if the distance between any two vertices in T is at most t times their distance in G . The tree t-spanner has many applications in networks and distributed environments. In this paper, an algorithm is presented to find a tree 3 -spanner on trapezoid graphs in ) ( 2 n O time, where n is the number of vertices of the g...
متن کاملEfficient algorithm for the vertex connectivity of trapezoid graphs
The intersection graph of a collection of trapezoids with corner points lying on two parallel lines is called a trapezoid graph. These graphs and their generalizations were applied in various fields, including modeling channel routing problems in VLSI design and identifying the optimal chain of non-overlapping fragments in bioinformatics. Using modified binary indexed tree data structure, we de...
متن کاملAn efficient algorithm for finding the semi-obnoxious $(k,l)$-core of a tree
In this paper we study finding the $(k,l)$-core problem on a tree which the vertices have positive or negative weights. Let $T=(V,E)$ be a tree. The $(k,l)$-core of $T$ is a subtree with at most $k$ leaves and with a diameter of at most $l$ which the sum of the weighted distances from all vertices to this subtree is minimized. We show that, when the sum of the weights of vertices is negative, t...
متن کاملMinimum Average Distance Triangulations
Some of the following problems look similar to the MAD Triangulation problem, but we have not found any deep connections: •Minimum Average Distance Spanning Subgraph in a budgeted version [2] was studied in the context of network design (minimizing average routing time). The problem is NP-complete even with unit weights. •Minimum Average Distance Spanning Tree [1]. NP-completeness is implied by...
متن کاملHardware and Software Implementations of Prim's Algorithm for Efficient Minimum Spanning Tree Computation
Minimum spanning tree (MST) problems play an important role in many networking applications, such as routing and network planning. In many cases, such as wireless ad-hoc networks, this requires efficient high-performance and low-power implementations that can run at regular intervals in real time on embedded platforms. In this paper, we study custom software and hardware realizations of one com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scientific Research and Reports
سال: 2013
ISSN: 2320-0227
DOI: 10.9734/jsrr/2013/4661