| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9514518 | Electronic Notes in Discrete Mathematics | 2005 | 5 Pages |
Abstract
In this work we introduce and describe optimal sets of survivable paths defined on an undirected simple graph G. An optimal set of survivable paths in G corresponds to a set of mesh-restored lightpaths in an optical network that minimizes the number of optical channels. We present several fundamental properties of optimal sets of survivable paths in G.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Z.R. Bogdanowicz,