DocumentCode :
1177068
Title :
On minimum multigraphs with prescribed lower bounds on local line connectivities
Author :
Boesch, Frank ; Butler, David E.
Volume :
23
Issue :
12
fYear :
1976
fDate :
12/1/1976 12:00:00 AM
Firstpage :
821
Lastpage :
823
Abstract :
Multiple path requirements for networks with integer line capacities (multigraphs) can be stated in a very general form by a reliabilIty matrix 
, where 
is the specified lower bound on the number of line-disjoint paths between points 
and 
in the multigraph. In light of the classical "max-flow, min-cut" theorem, this is equivalent to specifying local line connectivities. This paper presents a new and conceptually simple algorithm for constructing minimum size (total number of lines) multigraphs which satisfy the requirements specified in a reliability matrix.
, where is the specified lower bound on the number of line-disjoint paths between points and in the multigraph. In light of the classical "max-flow, min-cut" theorem, this is equivalent to specifying local line connectivities. This paper presents a new and conceptually simple algorithm for constructing minimum size (total number of lines) multigraphs which satisfy the requirements specified in a reliability matrix.Keywords :
Communication networks; Communication system reliability; Butler matrix; Communication networks; Joining processes; Linear programming; Telecommunication network reliability; Terminology;
fLanguage :
English
Journal_Title :
Circuits and Systems, IEEE Transactions on
Publisher :
ieee
ISSN :
0098-4094
Type :
jour
DOI :
10.1109/TCS.1976.1084161
Filename :
1084161
Link To Document :
