About us      Divisions     Telescopes     Science     Publications     Education     Targeted training     Service     Contacts

Preprints. 2004

Guaranteed estimations of P-medians of prefractal graphs with seeding agents - complete n-vertex graph, edge, n-vertex star

In the present study the upper- and lower-bound estimates of P-medians of prefractal (n,L)-graphs G_l = (V_l,E_l) with seeding agents - edge, n-vertex star, complete n-vertex graph, if prefractal (n,L)-graph is a dyadic tree, are found. An algorithm of optimum determination of P-medians of prefractal graphs is proposed.

Keywords: P-median, edge, n-vertex star, complete n-vertex graph, dyadic tree