Property Testing on k-Vertex-Connectivity of Graphs

ISSN： 0178-4617

Source： Algorithmica, Vol.62, Iss.3-4, 2012-04, pp. : 701-712

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

Distribution-Free Connectivity Testing for Sparse Graphs

By Halevy Shirley Kushilevitz Eyal

Algorithmica, Vol. 51, Iss. 1, 2008-05 ,pp. : 24-48

Springer Publishing Company

Access to resources Recommend Favorite

On the Benefits of Adaptivity in Property Testing of Dense Graphs

By Gonen Mira Ron Dana

Algorithmica, Vol. 58, Iss. 4, 2010-12 ,pp. : 811-830

Springer Publishing Company

Access to resources Recommend Favorite

Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs

By Hartmann A.K. Weigt M.

Theoretical Computer Science, Vol. 265, Iss. 1, 2001-08 ,pp. : 199-225

Elsevier

Access to resources Recommend Favorite

k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees

By Emek Yuval

Algorithmica, Vol. 61, Iss. 1, 2011-09 ,pp. : 141-160

Springer Publishing Company

Access to resources Recommend Favorite

Minimized embedding of arbitrary hamiltonian graphs in fault-tolerant graph and reconfiguration at faults. II. Grids and k-fault-tolerance

By Karavai M.

Automation and Remote Control, Vol. 66, Iss. 2, 2005-02 ,pp. : 328-340

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite