RNLKWC Digital Repository
Raja Narendra Lal Khan Women's College (Autonomous)
This is an open access repository of administrative and academic documents, and research output.
Please use this identifier to cite or link to this item:
http://111.93.204.14:8080/xmlui/handle/123456789/1156| Title: | Computation of inverse 1-centre location problem on the weighted interval graphs |
| Authors: | Jana, Biswanath Mondal, Sukumar Pal, Madhumangal |
| Keywords: | Tree-networks Centre location 1-centre location Inverse 1-centre location Inverse optimisation Interval graphs |
| Issue Date: | 2017 |
| Publisher: | International Journal of Computing Science and Mathematics |
| Abstract: | Let TIG be the tree corresponding to the weighted interval graph G = (V, E). In an inverse 1-centre location problem the parameter of an interval tree TIG corresponding to the weighted interval 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-centre of the interval graph G. In this paper, we present an O(n) time algorithm to find an inverse 1-centre location problem on the weighted tree TIG corresponding to the weighted interval graph, where the vertex weights can be changed within certain bounds and n is the number of vertices of the graph G. |
| URI: | http://111.93.204.14:8080/xmlui/handle/123456789/1156 |
| ISSN: | 1752-5055 1752-5063 |
| Appears in Collections: | Articles |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Inv-1-Int.pdf | 224.41 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.