Please use this identifier to cite or link to this item: http://localhost:80/xmlui/handle/123456789/1158
Title: Computation of Inverse 1-Center Location Problem on The Weighted Trapezoid Graphs
Authors: Jana, Biswanath
Mondal, Sukumar
Pal, Madhumangal
Keywords: Trapezoid graph
Inverse 1-center location problem
Issue Date: 2019
Publisher: Missouri Journal of Mathematical Sciences
Abstract: TT RP be the tree corresponding to the weighted trapezoid graph G = (V, E). The eccentricity e(v) of the vertex v is defined as the sum of the weights of the vertices from v to the vertex farthest from v ∈ TT RP . A vertex with minimum eccentricity in the tree TT RP is called the 1-center of that tree. In an inverse 1-center location problem, the parameter of the tree TT RP corresponding to the weighted trapezoid graph G = (V, E), like vertex weights, have to be modified at minimum total cost such that a pre-specified vertex s ∈ V becomes the 1-center of the trapezoid graph G. In this paper, we present an optimal algorithm to find an inverse 1-center location on the weighted tree TT RP corresponding to the weighted trapezoid graph G = (V, E), where the vertex weights can be changed within certain bounds. The time complexity of our proposed algorithm is O(n), where n is the number of vertices of the trapezoid graph G.
URI: http://111.93.204.14:8080/xmlui/handle/123456789/1158
ISSN: 0899-6180
1085-2581
Appears in Collections:Articles

Files in This Item:
File Description SizeFormat 
Inv-1-Tra.pdf235.78 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.