Currently displaying 1 – 20 of 21

Showing per page

Order by Relevance | Title | Year of publication

On the computational complexity of centers locating in a graph

Ján Plesník — 1980

Aplikace matematiky

It is shown that the problem of finding a minimum k -basis, the n -center problem, and the p -median problem are N P -complete even in the case of such communication networks as planar graphs with maximum degree 3. Moreover, a near optimal m -center problem is also N P -complete.

Page 1 Next

Download Results (CSV)