On forwarding indices of networks

@article{Heydemann1989OnFI,
  title={On forwarding indices of networks},
  author={Marie-Claude Heydemann and J. C. Meyer and Dominique Sotteau},
  journal={Discrete Applied Mathematics},
  year={1989},
  volume={23},
  pages={103-123}
}
A network (G, R) consists in a given undirected graph G of order n and a routing R, that is a collection of n(n1) simple paths connecting every ordered pair of vertices of G. Chung, Coffman, Reiman and Simon defined the forwarding index &(G, R) of a network (G, R) as the maximum number of paths of R passing through any vertex of G. Similarly we define the… CONTINUE READING

Topics

Statistics

051015'92'95'98'01'04'07'10'13'16
Citations per Year

150 Citations

Semantic Scholar estimates that this publication has 150 citations based on the available data.

See our FAQ for additional information.