Highly Influenced

# 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} }

- Published 1998 in Inf. Process. Lett.
DOI:10.1016/S0020-0190(98)00171-9

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.

#### Citations

##### Publications citing this paper.

#### References

##### Publications referenced by this paper.

Showing 1-10 of 10 references