Hardness of k-Vertex-Connected Subgraph Augmentation Problem

Author: Ma Changcun   Kim Donghyun   Wang Yuexuan   Wang Wei   Sohaee Nassim   Wu Weili  

Publisher: Springer Publishing Company

ISSN: 1382-6905

Source: Journal of Combinatorial Optimization, Vol.20, Iss.3, 2010-10, pp. : 249-258

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

Abstract