Pages that link to "Item:Q1804586"
From MaRDI portal
The following pages link to On complexity of subset interconnection designs (Q1804586):
Displaying 12 items.
- Maximum information stored in a labeled connected network with minimum edges (Q548186) (← links)
- An optimization problem on graphs (Q1085182) (← links)
- Approximations for subset interconnection designs (Q1274995) (← links)
- A special case for subset interconnection designs (Q1377654) (← links)
- Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem (Q1711667) (← links)
- Complexity of circuit intersection in graphs (Q1894765) (← 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)
- Two algorithms for the subset interconnection design problem (Q4018996) (← 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)
- Placing green bridges optimally, with a multivariate analysis (Q6635698) (← links)
