IEEE - Institute of Electrical and Electronics Engineers, Inc. - Minimum-cost augmentation to 3-edge-connect all specified vertices in a graph

1993 IEEE International Symposium on Circuits and Systems (ISCAS)

Author(s): T. Watanabe ; S. Taoka ; T. Mashima
Sponsor(s): IEEE
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Publication Date: 1 May 1993
Conference Location: Chicago, IL, USA
Conference Date: 3 May 1993
ISBN (Paper): 0-7803-1281-3
DOI: 10.1109/ISCAS.1993.394225
Regular:

The 3-edge-connectivity augmentation problem for a specified set of vertices, where the graph can have multiple edges, is addressed. Both the weighted version, in which there may exist some... View More

Advertisement