An optimization problem on graphs

DOI10.1016/0166-218X(86)90010-7zbMath0607.05047MaRDI QIDQ1085182

Ding-Zhu Du

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)

Related Items (6)

On the minimum feasible graph for four sets ⋮ A Computational Study of Reduction Techniques for the Minimum Connectivity Inference Problem ⋮ An improved flow-based formulation and reduction principles for the minimum connectivity inference problem ⋮ Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles ⋮ On complexity of subset interconnection designs ⋮ Approximations for subset interconnection designs

Cites Work

• Unnamed Item

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