• DocumentCode
    2181828
  • Title

    A polynomial algorithm for the MIN CUT linear arrangement of trees

  • Author

    Yannakakis, Mihalis

  • fYear
    1983
  • fDate
    7-9 Nov. 1983
  • Firstpage
    274
  • Lastpage
    281
  • Abstract
    An algorithm is presented which finds a min-cut linear arrangement of a tree in O(nlogn) time. An extension of the algorithm determines the number of pebbles needed to play the black and white pebble game on a tree.
  • Keywords
    Bandwidth; Circuits; Cost function; Joining processes; Minimization; Polynomials; Tree graphs; Very large scale integration; Wires;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1983., 24th Annual Symposium on
  • Conference_Location
    Tucson, AZ, USA
  • ISSN
    0272-5428
  • Print_ISBN
    0-8186-0508-1
  • Type

    conf

  • DOI
    10.1109/SFCS.1983.2
  • Filename
    4568088
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2181828