The p-median and p-center Problems on Bipartite Graphs
Author(s):
Abstract:
Let $G$ be a bipartite graph. In this paper we consider the two kind of location problems namely $p$-center and $p$-median problems on bipartite graphs. The $p$-center and $p$-median problems asks to find a subset of vertices of cardinality $p$, so that respectively the maximum and sum of the distances from this set to all other vertices in $G$ is minimized. For each case we present some properties to find exact solutions.
Keywords:
Location theory , $p$ , median , $p$ , center , Bipartite graphs
Language:
English
Published:
Iranian Journal of Mathematical Sciences and Informatics, Volume:9 Issue: 2, Nov 2014
Pages:
37 to 43
https://www.magiran.com/p1329590
سامانه نویسندگان
مقالات دیگری از این نویسنده (گان)
-
The inverse 1-median problem on a tree with transferring the weight of vertices
Tahere Sayar, *, Mojtaba Ghiyasi
Transactions on Combinatorics, Dec 2024 -
Algorithmic complexity of triple Roman dominating functions on graphs
Abolfazl Poureidi *,
Communications in Combinatorics and Optimization, Spring 2024