Vertex Cover Problem Parameterized Above and Below Tight Bounds

ISSN： 1432-4350

Source： Theory of Computing Systems, Vol.48, Iss.2, 2011-02, pp. : 402-410

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

Related content

Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter

By Jansen Bart

Theory of Computing Systems, Vol. 53, Iss. 2, 2013-08 ,pp. : 263-299

Springer Publishing Company

Access to resources Recommend Favorite

Average-distance problem for parameterized curves

By Lu Xin Yang Slepčev Dejan

ESAIM: Control, Optimisation and Calculus of Variations, Vol. 22, Iss. 2, 2016-04 ,pp. : 404-416

Edp Sciences

Access to resources Recommend Favorite

Squarefree Vertex Cover Algebras

By Bayati Shamila Rahmati Farhad

Communications in Algebra, Vol. 42, Iss. 4, 2014-04 ,pp. : 1518-1538

Taylor & Francis Ltd

Access to resources Recommend Favorite

Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification

By Kor Liah

Theory of Computing Systems, Vol. 53, Iss. 2, 2013-08 ,pp. : 318-340

Springer Publishing Company

Access to resources Recommend Favorite

Minimal complementation below uniform upper bounds for the arithmetical degrees

The Journal of Symbolic Logic, Vol. 61, Iss. 4, 1996-12 ,pp. : 1158-1192

Cambridge University Press

Access to resources Recommend Favorite