Logo (Main page)
Special Astrophysical Observatory RAS

Russian
   About us      Divisions     Telescopes     Science     Publications     Education     Targeted training     Service     Contacts  

Preprints. 2004

N202 (November)
Guaranteed estimations of P-medians of prefractal graphs with seeding agents - complete n-vertex graph, edge, n-vertex star
Authors: A.A.Uzdenov

In the present study the upper- and lower-bound estimates of P-medians of prefractal (n,L)-graphs Gl = (Vl,El) 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


Any questions to  webmaster 
Last update: 26/12/2008