An optimization problem on graphs

DOI10.1016/0166-218X(86)90010-7MaRDI QIDQ1085182zbMATH OpenFDO

Authors Du Ding-Zhu

Publication date 1986

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

NP-completenessminimum feasible graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)

Recommendations

• Publication:3470484
• On the minimum feasible graph for four sets
• Two algorithms for the subset interconnection design problem
• scientific article; zbMATH DE number 176254
• On complexity of subset interconnection designs

Cited in

(13)

• scientific article; zbMATH DE number 4137790 (Why is no real title available?)
• scientific article; zbMATH DE number 3910419 (Why is no real title available?)
• An improved flow-based formulation and reduction principles for the minimum connectivity inference problem
• Approximations for subset interconnection designs
• On complexity of subset interconnection designs
• A computational study of reduction techniques for the minimum connectivity inference problem
• Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles
• Placing green bridges optimally, with a multivariate analysis
• Some graph optimization problems with weights satisfying linear constraints
• Interval-parameter optimization problems on graphs
• On the minimum feasible graph for four sets
• scientific article; zbMATH DE number 4179413 (Why is no real title available?)
• Graphical method to solve combinatorial optimization problems

This page was built for publication: An optimization problem on graphs

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