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

Finding 2-edge connected spanning subgraphs

By Huh W.T.  

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

Elsevier

Access to resources Recommend Favorite

A Better Approximation Algorithm for Finding Planar Subgraphs

By Calinescu G.   Fernandes C.G.   Finkler U.   Karloff H.  

Journal of Algorithms, Vol. 27, Iss. 2, 1998-05 ,pp. : 269-302

Academic Press

Access to resources Recommend Favorite

Vertex Colouring and Forbidden Subgraphs – A Survey

By Randerath Bert   Schiermeyer Ingo  

Graphs and Combinatorics, Vol. 20, Iss. 1, 2004-03 ,pp. : 1-40

Springer Publishing Company

Access to resources Recommend Favorite

A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity

By Henzinger M.R.  

Journal of Algorithms, Vol. 24, Iss. 1, 1997-07 ,pp. : 194-220

Academic Press

Access to resources Recommend Favorite