scientific article; zbMATH DE number 1508265

DOI<link itemprop=identifier href="https://doi.org/10.1002/1097-0037(200007)35:4<253::AID-NET3>3.0.CO;2-K" /><253::AID-NET3>3.0.CO;2-K 10.1002/1097-0037(200007)35:4<253::AID-NET3>3.0.CO;2-KzbMath0974.05078MaRDI QIDQ4506265

Lihua Liu, Jian'er Chen, Wei-Jia Jia

Publication date: 14 September 2000

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

zbMATH Keywords

algorithmindependent setvertex coverparametrized computation

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (12)

Improved exact algorithms for MAX-SAT ⋮ Maximum Minimal Vertex Cover Parameterized by Vertex Cover ⋮ A multivariate framework for weighted FPT algorithms ⋮ Maximum Minimal Vertex Cover Parameterized by Vertex Cover ⋮ Solving larger maximum clique problems using parallel quantum annealing ⋮ Fast algorithms for max independent set ⋮ Confronting intractability via parameters ⋮ Improved upper bounds for vertex cover ⋮ Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems ⋮ Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3 ⋮ Parameterized computation and complexity: a new approach dealing with NP-hardness ⋮ Above guarantee parameterization for vertex cover on graphs with maximum degree 4

Cites Work

• An improved fixed-parameter algorithm for vertex cover
• Algorithms for maximum independent sets
• Vertex packings: Structural properties and algorithms
• Finding a Maximum Independent Set
• Nondeterminism within $P^ * $
• Unnamed Item
• Unnamed Item

This page was built for publication: