An Efficient Algorithm for Computation of a Minimum Average Distance Tree on Trapezoid Graphs

Channel:
India BP International
Subscribers:
8,840
Published on ● Video Link: https://www.youtube.com/watch?v=xS7sBvsVGls


Duration: 0:00
25 views
0

An Efficient Algorithm for Computation of a Minimum Average Distance Tree on Trapezoid Graphs | Chapter 03 | Theory and Applications of Mathematical Science Vol. 2

The average distance of a finite graph G=(V,E) is the average of the distances over all unordered pairs of vertices which can be used as a tool in analytic networks where the performance time is proportional to the distance between any two nodes. A minimum average distance spanning tree of G is a spanning tree of G with minimum average distance. Such a tree is sometimes referred to as a minimum routing cost spanning tree and these are of interest in the design of communication networks. In this chapter, I present an efficient algorithm to compute a minimum average distance spanning tree on trapezoid graphs in O(n^2) time, where n is the number of vertices of the graph.

Author(s) Details

Dr. Sukumar Mondal
Department of Mathematics, Raja N. L. Khan Women's College (Autonomous), Gope Palace, Paschim Medinipur, 721 102, West Bengal, India.

View full book: http://bp.bookpi.org/index.php/bpi/catalog/book/140



Other Videos By BP International


2020-03-05The Mediating Effect of Organizational Citizenship Behavior on the Organizational Justice
2020-03-05Organizational Citizenship Behaviour and Demographic Profiling
2020-03-04The Crowdfunding: A New Financial Instrument for the Start-ups?
2020-03-01Solve Special Case of Some Guran Problems
2020-03-01Common Fixed Point Theorems for a Pair of Self-Mappings in Fuzzy Cone Metric Spaces
2020-03-01On the Domination Conditions for Families of Quasinearly Subharmonic Functions
2020-02-29Existence of Solution of Nonlinear Functional Integral Equation Via Measure of Non-Compactness
2020-02-29Integrability and the Properties of Solutions to Euler and Navier-Stokes Equations
2020-02-29(p, q)-Growth of Meromorphic Functions and the Newton-Pade Approximant
2020-02-29Necessary and Sufficient Condition of Existence for the Quadrature Surfaces Free Boundary Problem
2020-02-29An Efficient Algorithm for Computation of a Minimum Average Distance Tree on Trapezoid Graphs
2020-02-29Statistical Distribution Analysis Implementation Using PROLOG and MATLAB for Wind Energy
2020-02-28Analysis of Probabilistic Distributions and Uncertainty of Information Flow at Administrative
2020-02-25PSO Based Emotional BPN and RBF Neural Network Models for Wind Speed Prediction
2020-02-24Leiomyoma of the Vulva: A Diagnostic Challenge Case Report
2020-02-24“Tibial Blowout”- A Complication of Arthroscopic Anterior Cruciate Ligament Reconstruction
2020-02-24Economic Burden of Diabetic Tuberculosis Patients from 3 Malaysian Hospitals
2020-02-24Attitude and Perception to Tattoos and Scarified Skin Marks in Makurdi, North Central Nigeria
2020-02-23Factors Affecting the Surgical Outcome of Primary Exotropia in Children
2020-02-23Antibacterial Activity of Polyphenolic Extracts from Different
2020-02-23Abdominal Wall Endometrioma: A Diagnostic Enigma-A Case Report and Review of the Literature