Mekkia KOUIDER
                (Laboratoire de Recherche en Informatique, Orsay (Francja))
 
      On weighted mean distance

 

We consider graphs with weights on the edges. We study the resulting average distance of the graph, mainly upper bounds in function of other parameters of the graph (order, edge-connectivity). If the collection of weights is fixed , the assignement of the weights in view to maximise the average distance is an NP-complete problem.  

 

  Serdecznie zapraszamy wszystkich chętnych !