The <Emphasis Type="Italic">p</Emphasis>-maxian problem on block graphs |
| |
| Authors: | Liying Kang Yukun Cheng |
| |
| Institution: | 1.Department of Mathematics,Shanghai University,Shanghai,China;2.School of Mathematics and Statistics,Zhejiang University of Finance and Economics,Hangzhou,China |
| |
| Abstract: | This paper deals with the p-maxian problem on block graphs with unit edge length. It is shown that the two points with maximum distance provide an optimal
solution for the 2-maxian problem of block graphs except for K
3. It can easily be extended to the p-maxian problem of block graphs. So we solve the p-maxian problem on block graphs in linear time. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
