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.
Author supplied keywords
Cite
CITATION STYLE
APA
Yannakakis, M. (1985). A polynomial algorithm for the min-cut linear arrangement of trees. Journal of the ACM (JACM), 32(4), 950–988. https://doi.org/10.1145/4221.4228
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free