A note on the computational complexity of bracketing and related problems
- 102 Downloads
It is shown that the problem of finding the minimum number of bracketing transfers in order to transform one bracketing to another bracketing is an NP-complete problem. This problem is related to problems on random walks, planar triangulations of convex polygons and to the problem of comparison of two (labeled) rooted trees. The latter problem is studied with the connection to cluster analysis. Finally, some polynomially solvable classes of bracketing problems are obtained.
KeywordsRooted Tree Convex Polygon Planar Triangulation Solvable Classis Binary Rooted Tree
Unable to display preview. Download preview PDF.
- L. COMTET: Advanced combinatorics. D Reidel, Boston 1974.Google Scholar
- K. CULIK II, D. WOOD: A note on some tree similarity measures, Information Processing Letters, 15(1982), 39–42.Google Scholar
- M. R. GAREY, D. S. JOHNSON: Computers and Intractability. W. H. Freeman, San Francisco, 1979.Google Scholar
- M. A. HARRISON: Introduction to formal language theory. Addison-Wesley, 1978.Google Scholar
- M. HOFRI: Probabilistic analysis of algorithms. Springer, 1987.Google Scholar
- R. KEMP: Fundamentals of the average case analysis of particular algorithms. Willey-Teubner, Stuttgart, 1984.Google Scholar
- M. KRIVANEK: The computational complexity of the consensus between hierarchical trees. Proc IMYCS'84, Smolenice, 119–125.Google Scholar
- M. KRIVANEK: A note on the computational complexity of computing the edge rotation distance between graphs. Cas.pest.mat. 113(1988),52–55.Google Scholar
- K. MEHLHORN: Data structures and algorithms, Vol. 1 and 3, Springer, 1984.Google Scholar
- SCHRODER: Vier ccombinatorische Probleme, Z. fur M. Phys., 15(1870), 361–376.Google Scholar
- D. D. SLEATOR, R. E. TARJAN, W. P. THURSTON: Rotation distance, triangulations, and hyperbolic geometry. Proc ACM STOC(1986), 122–135.Google Scholar