scientific article; zbMATH DE number 7667277

MaRDI QIDQ5884490

No author found.

Publication date: 23 March 2023

Full work available at URL: http://mathnet.ru/eng/svmo603

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

zbMATH Keywords

polynomial-time algorithmdominating set problemindependent set problemmatrix minorBoolean linear programming

Mathematics Subject Classification ID

Combinatorics (05-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Integer program with bimodular matrix
• Linear time algorithms for NP-hard problems restricted to partial k- trees
• Mangoes and blueberries
• On linear and circular structure of (claw, net)-free graphs
• A note on non-degenerate integer programs with small sub-determinants
• Edge dominating set and colorings on graphs with fixed clique-width
• Linear time solvable optimization problems on graphs of bounded clique-width
• Polynomial algorithms in linear programming

Related Items (4)

Parameterized complexity of the MinCCA problem on graphs of bounded decomposability ⋮ On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size ⋮ The complexity of the vertex-minor problem ⋮ FPT-algorithm for computing the width of a simplex given by a convex hull

This page was built for publication: