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

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

Parallel algorithms for Hamiltonian problems on quasi-threshold graphs

By Nikolopoulos S.D.  

Journal of Parallel and Distributed Computing, Vol. 64, Iss. 1, 2004-01 ,pp. : 48-67

Elsevier

Access to resources Recommend Favorite

Optimal parallel algorithms for path problems on planar graphs

By Srikrishna G.   Rangan C.P.  

Theoretical Computer Science, Vol. 145, Iss. 1, 1995-07 ,pp. : 27-43

Elsevier

Access to resources Recommend Favorite

Linear-time algorithms for parametric minimum spanning tree problems on planar graphs

By Fernandez-Baca D.   Slutzki G.  

Theoretical Computer Science, Vol. 181, Iss. 1, 1997-07 ,pp. : 57-74

Elsevier

Access to resources Recommend Favorite