• DocumentCode
    761586
  • Title

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

  • Author

    Mirzaian, Andranik ; Steiglitz, Kenneth

  • Author_Institution
    Princeton University, Princeton, NJ
  • Volume
    29
  • Issue
    10
  • fYear
    1981
  • fDate
    10/1/1981 12:00:00 AM
  • Firstpage
    1549
  • Lastpage
    1552
  • 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;
  • fLanguage
    English
  • Journal_Title
    Communications, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0090-6778
  • Type

    jour

  • DOI
    10.1109/TCOM.1981.1094884
  • Filename
    1094884
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=761586