Forwarding and optical indices of a graph
- 22 April 2008
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 157 (2) , 321-329
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- The maximum edge-disjoint paths problem in complete graphsTheoretical Computer Science, 2008
- Path Coloring and Routing in Graphs2004
- All-to-all wavelength-routing in all-optical compound networksDiscrete Mathematics, 2001
- Optimal wavelength-routed multicastingDiscrete Applied Mathematics, 1998
- Expanding and forwardingDiscrete Applied Mathematics, 1995
- Forwarding indices of consistent routings and their complexityNetworks, 1994
- On the edge forwarding index problem for small graphsNetworks, 1993
- On forwarding indices of networksDiscrete Applied Mathematics, 1989
- The forwarding index of communication networksIEEE Transactions on Information Theory, 1987
- Edge-colourings of graphs: S. Fiorini and R. J. Wilson, Research Notes in Mathematics 16, Pitman, 1977, 154 pp.Advances in Mathematics, 1978