scientific article; zbMATH DE number 3943843

MaRDI QIDQ3715136zbMATH OpenFDO

Authors Lothar Butz, Peter L. Hammer, D. Haussmann

Publication date 1984

zbMATH Keywords

maximum stable setvertex packing

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On the vertex packing problem
• scientific article; zbMATH DE number 3976364
• Algorithm for the vertex packing problem
• Relaxations of vertex packing
• A polyhedral study of the generalized vertex packing problem
• An edge-reduction algorithm for the vertex cover problem
• The mixed vertex packing problem.
• Lower bounds and reduction procedures for the bin packing problem
• A reduction approach for solving the rectangle packing area minimization problem
• Polynomial reductions between the limited packing and tuple domination problems in graphs

Cited in

(11)

• Graph transformations preserving the stability number
• Extending the MAX algorithm for maximum independent set
• A magnetic procedure for the stability number
• Struction revisited
• The mixed vertex packing problem.
• Relaxations of vertex packing
• Stability preserving transformations of graphs
• Graph transformations preserving the stability number
• scientific article; zbMATH DE number 3976364 (Why is no real title available?)
• Algorithm for the vertex packing problem
• A clique search problem and its application to machine scheduling

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 Q3715136)