Advertisement

A note on the computational complexity of bracketing and related problems

  • Mirko Křivánek
Chapter 3 Algorithmics
  • 102 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 381)

Abstract

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.

Keywords

Rooted Tree Convex Polygon Planar Triangulation Solvable Classis Binary Rooted Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    L. COMTET: Advanced combinatorics. D Reidel, Boston 1974.Google Scholar
  2. [2]
    K. CULIK II, D. WOOD: A note on some tree similarity measures, Information Processing Letters, 15(1982), 39–42.Google Scholar
  3. [3]
    M. R. GAREY, D. S. JOHNSON: Computers and Intractability. W. H. Freeman, San Francisco, 1979.Google Scholar
  4. [4]
    M. A. HARRISON: Introduction to formal language theory. Addison-Wesley, 1978.Google Scholar
  5. [5]
    M. HOFRI: Probabilistic analysis of algorithms. Springer, 1987.Google Scholar
  6. [6]
    R. KEMP: Fundamentals of the average case analysis of particular algorithms. Willey-Teubner, Stuttgart, 1984.Google Scholar
  7. [7]
    M. KRIVANEK: The computational complexity of the consensus between hierarchical trees. Proc IMYCS'84, Smolenice, 119–125.Google Scholar
  8. [8]
    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
  9. [9]
    K. MEHLHORN: Data structures and algorithms, Vol. 1 and 3, Springer, 1984.Google Scholar
  10. [10]
    SCHRODER: Vier ccombinatorische Probleme, Z. fur M. Phys., 15(1870), 361–376.Google Scholar
  11. [11]
    D. D. SLEATOR, R. E. TARJAN, W. P. THURSTON: Rotation distance, triangulations, and hyperbolic geometry. Proc ACM STOC(1986), 122–135.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Mirko Křivánek
    • 1
  1. 1.Department of Computer ScienceCharles UniversityPraha 1

Personalised recommendations