scientific article; zbMATH DE number 1187143

MaRDI QIDQ3840348zbMATH OpenFDO

Authors Daishin Nakamura, Akihisa Tamura

Publication date 10 August 1998

zbMATH Keywords

bidirected graphsgeneralized stable set problem

Mathematics Subject Classification ID

Integer programming (90C10) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• THE GENERALIZED STABLE SET PROBLEM FOR PERFECT BIDIRECTED GRAPHS
• scientific article; zbMATH DE number 1766756
• Stable sets in claw-free graphs: a journey through algorithms and polytopes
• A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
• Solving the weighted stable set problem in claw-free graphs via decomposition

Cited in

(4)

• The stable set problem: clique and nodal inequalities revisited
• THE GENERALIZED STABLE SET PROBLEM FOR PERFECT BIDIRECTED GRAPHS
• scientific article; zbMATH DE number 1766756 (Why is no real title available?)
• Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3840348)