Skip to main content
SpringerLink
Log in

A note on the computational complexity of bracketing and related problems

  • Chapter 3 Algorithmics
  • Conference paper
  • First Online:
Machines, Languages, and Complexity (IMYCS 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 381))

Included in the following conference series:

  • 128 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. COMTET: Advanced combinatorics. D Reidel, Boston 1974.

    Google Scholar 

  2. K. CULIK II, D. WOOD: A note on some tree similarity measures, Information Processing Letters, 15(1982), 39–42.

    Google Scholar 

  3. M. R. GAREY, D. S. JOHNSON: Computers and Intractability. W. H. Freeman, San Francisco, 1979.

    Google Scholar 

  4. M. A. HARRISON: Introduction to formal language theory. Addison-Wesley, 1978.

    Google Scholar 

  5. M. HOFRI: Probabilistic analysis of algorithms. Springer, 1987.

    Google Scholar 

  6. R. KEMP: Fundamentals of the average case analysis of particular algorithms. Willey-Teubner, Stuttgart, 1984.

    Google Scholar 

  7. M. KRIVANEK: The computational complexity of the consensus between hierarchical trees. Proc IMYCS'84, Smolenice, 119–125.

    Google Scholar 

  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. K. MEHLHORN: Data structures and algorithms, Vol. 1 and 3, Springer, 1984.

    Google Scholar 

  10. SCHRODER: Vier ccombinatorische Probleme, Z. fur M. Phys., 15(1870), 361–376.

    Google Scholar 

  11. D. D. SLEATOR, R. E. TARJAN, W. P. THURSTON: Rotation distance, triangulations, and hyperbolic geometry. Proc ACM STOC(1986), 122–135.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Charles University, Malostranské nám. 25, CS-118 00, Praha 1

    Mirko Křivánek

Authors
  1. Mirko Křivánek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Dassow J. Kelemen

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Křivánek, M. (1989). A note on the computational complexity of bracketing and related problems. In: Dassow, J., Kelemen, J. (eds) Machines, Languages, and Complexity. IMYCS 1988. Lecture Notes in Computer Science, vol 381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015934

Download citation

  • DOI: https://doi.org/10.1007/BFb0015934

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51516-6

  • Online ISBN: 978-3-540-48203-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation