A polynomial algorithm for the min-cut linear arrangement of trees

Abstract

An algorithm is presented that finds a min-cut linear arrangement of a tree in O(n log n) time. An extension of the algorithm determines the number of pebbles needed to play the black and white pebble game on a tree. © 1985, ACM. All rights reserved.