Pages that link to "Item:Q3822178"

The following pages link to Matroids and Subset Interconnection Design (Q3822178):

Displaying 11 items.

• The minimum feasible tileset problem (Q666670) (← links)
• Approximations for subset interconnection designs (Q1274995) (← links)
• Non-empty cross-2-intersecting families of subsets (Q1319142) (← links)
• A special case for subset interconnection designs (Q1377654) (← links)
• Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem (Q1711667) (← links)
• On complexity of subset interconnection designs (Q1804586) (← links)
• On the minimum feasible graph for four sets (Q1908609) (← links)
• Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles (Q2042074) (← links)
• A Computational Study of Reduction Techniques for the Minimum Connectivity Inference Problem (Q5114944) (← links)
• An improved flow-based formulation and reduction principles for the minimum connectivity inference problem (Q5197998) (← links)
• Overlaying a hypergraph with a graph with bounded maximum degree (Q5918772) (← links)