• DocumentCode
    1140279
  • Title

    The Design of Small-Diameter Networks by Local Search

  • Author

    Toueg, Sam ; Steiglitz, Kenneth

  • Author_Institution
    Department of Electrical Engineering and Computer Science, Princeton University
  • Issue
    7
  • fYear
    1979
  • fDate
    7/1/1979 12:00:00 AM
  • Firstpage
    537
  • Lastpage
    542
  • Abstract
    A local search algorithm for the design of small-diameter networks is presented for both directed and undirected regular graphs. In all cases the resulting graphs are at least as good as any previously known, in the sense that they have at least as small a diameter and average shortest distance for a given number of nodes and degrees.
  • Keywords
    Communication networks; delay; diameter; graphs; networks; Algorithm design and analysis; Communication networks; Logic; Microprocessors; Minimization; Polarization; Polynomials; Switching circuits; Telecommunication network reliability; Telecommunication traffic; Communication networks; delay; diameter; graphs; networks;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.1979.1675402
  • Filename
    1675402
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1140279