Finding 2-edge connected spanning subgraphs

Author： Huh W.T.  

Publisher： Elsevier

ISSN： 0167-6377

Source： Operations Research Letters, Vol.32, Iss.3, 2004-05, pp. : 212-216

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs

By Dinitz Y.   Nutov Z.  

Journal of Algorithms, Vol. 32, Iss. 1, 1999-07 ,pp. : 31-40

Academic Press

Access to resources Recommend Favorite

A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph

By Auletta V.   Dinitz Y.   Nutov Z.   Parente D.  

Journal of Algorithms, Vol. 32, Iss. 1, 1999-07 ,pp. : 21-30

Academic Press

Access to resources Recommend Favorite

The 2-Edge-Connected Subgraph Polyhedron

By Vandenbussche Dieter   Nemhauser George  

Journal of Combinatorial Optimization, Vol. 9, Iss. 4, 2005-06 ,pp. : 357-379

Springer Publishing Company

Access to resources Recommend Favorite

A Better Approximation Ratio for the Minimum Size k-Edge-Connected Spanning Subgraph Problem

By Fernandes C.G.  

Journal of Algorithms, Vol. 28, Iss. 1, 1998-07 ,pp. : 105-124

Academic Press

Access to resources Recommend Favorite

Problems of synthesis of connected networks with respect to isomorphic subgraphs

By Sharifov F.  

Cybernetics and Systems Analysis, Vol. 40, Iss. 5, 2004-09 ,pp. : 735-738

Springer Publishing Company

Access to resources Recommend Favorite