scientific article; zbMATH DE number 1420918

zbMath0952.68111MaRDI QIDQ4944990

Iyad A. Kanj, Wei-Jia Jia, Jian'er Chen

Publication date: 7 June 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

VERTEX COVER problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Solving large FPT problems on coarse-grained parallel machines, Call control with \(k\) rejections, Computing crossing numbers in quadratic time, The Impact of Parameterized Complexity to Interdisciplinary Problem Solving, Unnamed Item, Approximate Turing Kernelization for Problems Parameterized by Treewidth, Efficiency in exponential time for domination-type problems, Parameterized Complexity, Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover, A general method to speed up fixed-parameter-tractable algorithms