On the minimum feasible graph for four sets

DOI10.1007/BF02662501zbMATH Open0841.05044OpenAlexW2082423080MaRDI QIDQ1908609FDOQ1908609

Yinfeng Xu, Xiaobing Fu

Publication date: 4 March 1996

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02662501

zbMATH Keywords

NP-completespanning treefeasible graphpolynomial-time solvable

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35)

Cites Work

• Title not available (Why is that?)
• An optimization problem on graphs
• Matroids and Subset Interconnection Design
• Title not available (Why is that?)

Cited In (2)

• Four problems on graphs with excluded minors
• Minimum networks for four points in space

   Recommendations

• An optimization problem on graphs 👍 👎
• Two algorithms for the subset interconnection design problem 👍 👎
• Matroids and Subset Interconnection Design 👍 👎
• On complexity of subset interconnection designs 👍 👎

This page was built for publication: On the minimum feasible graph for four sets

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