By Topic

Maximum weight matching-based algorithms for k-edge-connectivity augmentation of a graph

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Taoka, S. ; Graduate Sch. of Eng., Hiroshima Univ., Japan ; Watanabe, T. ; Mashima, T.

The subject of the paper is to show that, by utilizing maximum-weight matching algorithms, we obtain heuristic algorithms of high capability for the k-edge-connectivity augmentation problem of graphs. The following points are shown by experimentally comparing the capabilities of eighteen algorithms for 4,175 graphs G' = (V, E') with 10≤|V|≤1400: (1) an existing algorithm, FSM, (previously proposed by us), based on an algorithm for finding a maximum-weight matching, produces the best solutions, while it becomes unrealistic when |V|>1000; (2) by utilizing a 2-approximation algorithm for the maximum-weight matching problem, a promising algorithm, HBDa+, is proposed, and it is shown that the second best solution (average 1.017 times that of FSM) is obtained in much shorter CPU time (average 0.1 times that of FSM).

Published in:

Circuits and Systems, 2005. ISCAS 2005. IEEE International Symposium on

Date of Conference:

23-26 May 2005