On complexity of subset interconnection designs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 25606 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- An optimization problem on graphs
- Matroids and Subset Interconnection Design
- On the complexity of an optimal routing tree problem
- Some simplified NP-complete graph problems
Cited in
(17)- An optimization problem on graphs
- Maximum information stored in a labeled connected network with minimum edges
- An improved flow-based formulation and reduction principles for the minimum connectivity inference problem
- Polynomial-time data reduction for the subset interconnection design problem
- Approximations for subset interconnection designs
- Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles
- Matroids and Subset Interconnection Design
- A special case for subset interconnection designs
- Placing green bridges optimally, with a multivariate analysis
- Overlaying a hypergraph with a graph with bounded maximum degree
- scientific article; zbMATH DE number 2170471 (Why is no real title available?)
- Algorithms and Implementation for Interconnection Graph Problem
- Complexity of circuit intersection in graphs
- Two algorithms for the subset interconnection design problem
- Complexity dichotomies for the minimum \(\mathcal{F}\)-overlay problem
- Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem
- Effective and efficient data reduction for the subset interconnection design problem
This page was built for publication: On complexity of subset interconnection designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804586)
