Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem

ISSN： 0178-4617

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

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

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems

By Fellows M. Knauer C. Nishimura N. Ragde P. Rosamond F. Stege U. Thilikos D. Whitesides S.

Algorithmica, Vol. 52, Iss. 2, 2008-10 ,pp. : 167-176

Springer Publishing Company

Access to resources Recommend Favorite

A fixed-parameter algorithm for minimum quartet inconsistency

By Gramm J. Niedermeier R.

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

Elsevier

Access to resources Recommend Favorite

Fixed-Parameter Complexity of Minimum Profile Problems

By Gutin Gregory Szeider Stefan Yeo Anders

Algorithmica, Vol. 52, Iss. 2, 2008-10 ,pp. : 133-152

Springer Publishing Company

Access to resources Recommend Favorite

Algorithms for vertex-partitioning problems on graphs with fixed clique-width

By Gerber M.U. Kobler D.

Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. : 719-734

Elsevier

Access to resources Recommend Favorite

Fixed-parameter tractability and completeness II: On completeness for W[1]

By Downey R.G. Fellows M.R.

Theoretical Computer Science, Vol. 141, Iss. 1, 1995-04 ,pp. : 109-131

Elsevier

Access to resources Recommend Favorite