• DocumentCode
    2830628
  • Title

    A linear time augmenting algorithm for 3-edge-connectivity augmentation problems

  • Author

    Watanabe, Toshimasa ; Yamakado, Mitsuhiro ; Onaga, Kenji

  • Author_Institution
    Fac. of Eng., Hiroshima Univ., Higashi-Hiroshima, Japan
  • fYear
    1991
  • fDate
    11-14 Jun 1991
  • Firstpage
    1168
  • Abstract
    The subject is the 3-edge-connectivity augmentation problem. Given an undirected multi-graph G0=(V, E), find an edge set E´ of minimum cardinality such that the graph (V, E∪E´) is 3-edge-connected, where each edge of E´ connects vertices of V. The authors propose an O(|V|+|E|) augmenting algorithm for the problem. It finds a solution to the 3-edge-connectivity augmentation problem if all k-components ( k⩽3) of G0 are available
  • Keywords
    graph theory; topology; 3-edge-connectivity augmentation problems; edge set; linear time augmenting algorithm; minimum cardinality; undirected multi-graph; vertices; Approximation algorithms; Bridges; Circuits and systems; Mathematics; Partitioning algorithms; Polynomials; Tree graphs;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 1991., IEEE International Sympoisum on
  • Print_ISBN
    0-7803-0050-5
  • Type

    conf

  • DOI
    10.1109/ISCAS.1991.176575
  • Filename
    176575
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2830628