On Cutwidth Parameterized by Vertex Cover

Author： Cygan Marek   Lokshtanov Daniel   Pilipczuk Marcin   Pilipczuk Michał   Saurabh Saket  

Publisher： Springer Publishing Company

ISSN： 0178-4617

Source： Algorithmica, Vol.68, Iss.4, 2014-04, pp. : 940-953

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

Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms

By Chen J.   Kanj I.A.  

Journal of Computer and System Sciences, Vol. 67, Iss. 4, 2003-12 ,pp. : 833-847

Elsevier

Access to resources Recommend Favorite

Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem

By Kratsch Stefan   Neumann Frank  

Algorithmica, Vol. 65, Iss. 4, 2013-04 ,pp. : 754-771

Springer Publishing Company

Access to resources Recommend Favorite

An Ant Colony Optimization Algorithm for the Minimum Weight Vertex Cover Problem

By Shyu Shyong   Yin Peng-Yeng   Lin Bertrand  

Annals of Operations Research, Vol. 131, Iss. 1-4, 2004-10 ,pp. : 283-304

Springer Publishing Company

Access to resources Recommend Favorite

Improved non-approximability results for minimum vertex cover with density costraints

By Clementi A.E.F.   Trevisan L.  

Theoretical Computer Science, Vol. 225, Iss. 1, 1999-08 ,pp. : 113-128

Elsevier

Access to resources Recommend Favorite

Small Vertex Cover makes Petri Net Coverability and Boundedness Easier

By Praveen M.  

Algorithmica, Vol. 65, Iss. 4, 2013-04 ,pp. : 713-753

Springer Publishing Company

Access to resources Recommend Favorite