Open AccessAn Efficient Algorithm for Computation of a Minimum Average Distance Tree on Trapezoid Graphs
Author(s) -
Sukumar Mondal
Publication year - 2013
Publication title -
journal of scientific research and reports
Language(s) - English
Resource type - Journals
ISSN - 2320-0227
DOI - 10.9734/jsrr/2013/4661
Subject(s) - minimum spanning tree , spanning tree , mathematics , combinatorics , kruskal's algorithm , shortest path tree , reverse delete algorithm , minimum degree spanning tree , tree (set theory) , prim's algorithm , computation , gomory–hu tree , minimum distance , graph , k minimum spanning tree , distributed minimum spanning tree , discrete mathematics , algorithm , k ary tree , tree structure , binary tree
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom