Title of article :
A 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph
Author/Authors :
Hiroshi Nagamochi، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2005
Pages :
19
From page :
77
To page :
95
Keywords :
NP-hard , graph algorithms , approximation algorithms , connectivity , Cut-vertex
Journal title :
Journal of Algorithms
Serial Year :
2005
Journal title :
Journal of Algorithms
Record number :
291675
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=291675
