By Topic

A Note on the Complexity of the Star-Star Concentrator Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Mirzaian, A. ; Princeton University, Princeton, NJ ; Steiglitz, K.

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.

Published in:

Communications, IEEE Transactions on  (Volume:29 ,  Issue: 10 )