Algorithms for the remoteness function, and the median and antimedian sets in ℓ₁-graphs
by Manoj Changat; Divya Sindhu Lekha; Ajitha R. Subhamathi
International Journal of Computing Science and Mathematics (IJCSM), Vol. 6, No. 5, 2015

Abstract: The median (antimedian) set of a profile of vertices of a graph G is the set of vertices that minimise (maximise) the remoteness value. The median and antimedian problem of profiles on graphs is one of the basic models of desirable (as well as obnoxious) facility location problem in networks. The medians and antimedians behave nicely in classes of graphs like complete graphs, hypercubes and paths. In this paper, we study more classes of graphs in which the medians and antimedians have a nice structure, which admit a scale-embedding into hypercubes known as ℓ₁-graphs and design algorithms for both (median and antimedian) problems. We particularly discuss the cases of half-cubes, Johnson graphs and cocktail-party graphs.

Online publication date: Tue, 10-Nov-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com