An efficient algorithm for the inverse eccentric problem under the Chebyshev distance

عنوان به زبان ديگر

پديدآورندگان

Tayyebi Javad javadtayyebi@birjandut.ac.ir Birjand University of Technology, , Kazemi Seyed Mohammad Reza kazemi@birjandut.ac.ir Birjand University of Technology,

تعداد صفحه

4

كليدواژه

Eccentric problem , Inverse problem , Chebyshev distance.

سال انتشار

1396

عنوان كنفرانس

دومين كنفرانس ملي تركيبيات رمزنگاري و محاسبات

زبان مدرك

انگليسي

چكيده فارسي

For a given network G(V, A, c) and two specified nodes s and t, the inverse eccentric problem is to modify the edge length vector c as little as possible so that 𝑡 becomes the furthest node from 𝑠. In this paper, we study the inverse eccentric problem when the underlying network is a tree and the length modifications are measured by the Chebyshev distance. We present a polynomial-time algorithm based on the binary search technique to solve the problem.

چكيده لاتين

For a given network G(V, A, c) and two specified nodes s and t, the inverse eccentric problem is to modify the edge length vector c as little as possible so that 𝑡 becomes the furthest node from 𝑠. In this paper, we study the inverse eccentric problem when the underlying network is a tree and the length modifications are measured by the Chebyshev distance. We present a polynomial-time algorithm based on the binary search technique to solve the problem.

كشور

ايران