Title :
A Note on the Complexity of the Star-Star Concentrator Problem
Author :
Mirzaian, Andranik ; Steiglitz, Kenneth
Author_Institution :
Princeton University, Princeton, NJ
fDate :
10/1/1981 12:00:00 AM
Abstract :
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.
Keywords :
Computer communications; Communications Society; Computer networks; Cost function; Design methodology; Joining processes; Military computing; NP-complete problem; Polynomials; Time measurement; Topology;
Journal_Title :
Communications, IEEE Transactions on
DOI :
10.1109/TCOM.1981.1094884
