An Eades-McKay Algorithm for Well-Formed Parentheses Strings

@article{Bultena1998AnEA,
  title={An Eades-McKay Algorithm for Well-Formed Parentheses Strings},
  author={Bette Bultena and Frank Ruskey},
  journal={Inf. Process. Lett.},
  year={1998},
  volume={68},
  pages={255-259}
}
Let T(n) be the set of all well-formed parentheses strings of length 2n. We show that the elements of T(n) can be listed so that successive strings diier by the transposition of a left and a right parenthesis. Furthermore, between the two parentheses that are transposed, only left parentheses occur. Our listing is a modiication of the well-known Eades-McKay 4] algorithm for generating combinations. Like that algorithm, ours generates strings from the lexico-graphically greatest string to the… CONTINUE READING
Highly Cited
This paper has 26 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 10 references

Akl and I. Stojmenovic, \Generating t-ary Trees in Parallel

  • Nordic J. of Computing
  • 1996

\A Survey of Binary Tree Codings

  • E Mm Akinen
  • The Computer Journal
  • 1991

\Combination generation and Graylex ordering

  • J Chase
  • Congressus Numerantium
  • 1989

Combinatorial Generation, book in preparation

  • F Ruskey
  • Combinatorial Generation, book in preparation

Similar Papers

Loading similar papers…