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

Author： Chen J.   Kanj I.A.  

Publisher： Elsevier

ISSN： 0022-0000

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

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

On Cutwidth Parameterized by Vertex Cover

By Cygan Marek   Lokshtanov Daniel   Pilipczuk Marcin   Pilipczuk Michał   Saurabh Saket  

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

Springer Publishing Company

Access to resources Recommend Favorite

Parameterized Algorithms in Smooth 4-Regular Hamiltonian Graphs

By Mujuni Egbert  

Mathematics in Computer Science, Vol. 1, Iss. 4, 2008-06 ,pp. : 701-708

Springer Publishing Company

Access to resources Recommend Favorite

Efficient parallel algorithms for doubly convex-bipartite graphs

By Chang-Wu Y.   Gen-Huey C.  

Theoretical Computer Science, Vol. 147, Iss. 1, 1995-08 ,pp. : 249-265

Elsevier

Access to resources Recommend Favorite

A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs

By Ljubić Ivana   Raidl Günther R.  

Journal of Heuristics, Vol. 9, Iss. 5, 2003-11 ,pp. : 401-427

Springer Publishing Company

Access to resources Recommend Favorite

New Approximation Algorithms for Minimum Cycle Bases of Graphs

By Kavitha Telikepalli   Mehlhorn Kurt   Michail Dimitrios  

Algorithmica, Vol. 59, Iss. 4, 2011-04 ,pp. : 471-488

Springer Publishing Company

Access to resources Recommend Favorite