Answers are grounded in this paper and cite their sources.
The star-star concentrator problem (SSCP) arises in computer network design. The complexity of this problem is studied, and polynomially solvable and (strongly) NP-complete cases are presented.
No takes yet. Share an insight, caveat, or question.
Mirzaian et al. (1981) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: