Computation of inverse 1-centre location problem on the weighted interval graphs
Summary: Let \(T_{IG}\) 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 \(T_{IG}\) 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 \in 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 \(T_{IG}\) 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\).
- Computation of inverse 1-center location problem on the weighted trapezoid graphs
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees
- Inverse center location problems
- Inverse \(k\)-centrum problem on trees with variable vertex weights
This page was built for publication: Computation of inverse 1-centre location problem on the weighted interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2224231)
