• DocumentCode
    3105893
  • Title

    Partitioning a network into n pieces with a time-efficient net cost function

  • Author

    Stravers, Paul

  • Author_Institution
    Delft Univ. of Technol., Netherlands
  • fYear
    1991
  • fDate
    25-28 Feb 1991
  • Firstpage
    177
  • Lastpage
    182
  • Abstract
    Discusses the generalization of the Fiduccia-Mattheyses linear time bi-partitioning algorithm to a linear-time n-partitioning algorithm. It uses a new heuristic cost function to evaluate the cost of arbitrarily large spanning trees in O(log n) time. Practical experiments show good results
  • Keywords
    VLSI; circuit layout CAD; Fiduccia-Mattheyses linear time bi-partitioning algorithm; O(log n) time; cost of arbitrarily large spanning trees; generalization; heuristic cost function; linear-time n-partitioning algorithm; network partitioning into n pieces; time-efficient net cost function; Computer networks; Cost function; Data structures; Iterative algorithms; Partitioning algorithms; Pins;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Design Automation. EDAC., Proceedings of the European Conference on
  • Conference_Location
    Amsterdam
  • Type

    conf

  • DOI
    10.1109/EDAC.1991.206385
  • Filename
    206385
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3105893