| Presentation | 1994/1/26 Simplicity-Preserving Augmentation of the Edge-Connectivity of a Graph Satoshi Taoka, Daisuke Takafuji, Toshimasa Watanabe, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | The unweighted κ-edge-connectivity augmentation problem(UW-κECA for short)is defined by ″Given a graph G =(N,A),find an edge set A′ of minimum cardinality,with each element connecting distinct ve rtices of N,such that G′ =(N,A ∩ A′)is κ-edge-connected.″The s ubject of the paper is UW-(λ+1)ECA(S,SA)for λ-edge-connected grap hs G with λ = 3 or 4,where UW-(λ+1)ECA(S,SA)denotes UW-(λ+1)ECA in which both G and G′ are simple.No characterizations or algorith ims for UW-(λ+1)ECA(S,SA)with λ【greater than or equal】3 have be en shown so far.The paper proposes the following two algorithims: (1)an Ο( A + N log N )algorithm for solving UW-4ECA(S,SA),where G is 3-edge-connected,simple and Ο( A + N ^2)algorithm for solving UW-5ECA(S,SA),where G is 4-edge- connected,simple and |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | connectivity augmentation problems / edge-connectivity / maximum matchings / poly nomial-time algorithms |
| Paper # | COMP93-73 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 1994/1/26(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Simplicity-Preserving Augmentation of the Edge-Connectivity of a Graph |
| Sub Title (in English) | |
| Keyword(1) | connectivity augmentation problems |
| Keyword(2) | edge-connectivity |
| Keyword(3) | maximum matchings |
| Keyword(4) | poly nomial-time algorithms |
| 1st Author's Name | Satoshi Taoka |
| 1st Author's Affiliation | Department of Circuits and Systems,Faculty of Engineering, Hiroshima University() |
| 2nd Author's Name | Daisuke Takafuji |
| 2nd Author's Affiliation | Department of Circuits and Systems,Faculty of Engineering, Hiroshima University |
| 3rd Author's Name | Toshimasa Watanabe |
| 3rd Author's Affiliation | Department of Circuits and Systems,Faculty of Engineering, Hiroshima University |
| Date | 1994/1/26 |
| Paper # | COMP93-73 |
| Volume (vol) | vol.93 |
| Number (no) | 438 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |