Matroids and Subset Interconnection Design

DOI10.1137/0401042MaRDI QIDQ3822178zbMATH OpenOpenAlexFDO

Authors Du Ding-Zhu, Z. 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

interconnection designmatroid theorymatroidsvacuum systems

Mathematics Subject Classification ID

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

Recommendations

• On complexity of subset interconnection designs
• scientific article; zbMATH DE number 3861184
• Two algorithms for the subset interconnection design problem
• Some New Matroids on Graphs: Cut Sets and the Max Cut Problem
• A special case for subset interconnection designs

Cited in

(13)

• Approximations for subset interconnection designs
• Non-empty cross-2-intersecting families of subsets
• A special case for subset interconnection designs
• Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem
• On complexity of subset interconnection designs
• On the minimum feasible graph for four sets
• Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles
• 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
• Overlaying a hypergraph with a graph with bounded maximum degree
• Placing green bridges optimally, with a multivariate analysis
• On the complexity of community-aware network sparsification
• A fast algorithm for computing a planar support for non-piercing rectangles

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

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