Matroids and Subset Interconnection Design

DOI10.1137/0401042zbMath0669.05021OpenAlexW2080022329MaRDI QIDQ3822178

Ding-Zhu Du, Zevi Miller

Publication date: 1988

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0401042

zbMATH Keywords

matroidsmatroid theoryinterconnection designvacuum systems

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (11)

On the minimum feasible graph for four sets ⋮ A special case for subset interconnection designs ⋮ A Computational Study of Reduction Techniques for the Minimum Connectivity Inference Problem ⋮ Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem ⋮ The minimum feasible tileset problem ⋮ Overlaying a hypergraph with a graph with bounded maximum degree ⋮ 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 ⋮ Non-empty cross-2-intersecting families of subsets

This page was built for publication: Matroids and Subset Interconnection Design