Thumbnail
Access Restriction
Subscribed

Author Yannakakis, Mihalis
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1985
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract An algorithm is presented that finds a min-cut linear arrangement of a tree in $\textit{O}(\textit{n}$ log $\textit{n})$ time. An extension of the algorithm determines the number of pebbles needed to play the black and white pebble game on a tree.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1985-10-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 32
Issue Number 4
Page Count 39
Starting Page 950
Ending Page 988


Open content in new tab

   Open content in new tab
Source: ACM Digital Library