Selected papers of the conference on Formal power series and algebraic combinatorics
Bounds for the growth rate of meander numbers
Journal of Combinatorial Theory Series A
Efficient exact algorithms on planar graphs: exploiting sphere cut branch decompositions
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Meander, folding, and arch statistics
Mathematical and Computer Modelling: An International Journal
Gray codes for reflectable languages
Information Processing Letters
| Hi-index | 0.00 |
An open meandric system is a planar configuration of acyclic curves crossing an infinite horizontal line in the plane such that the curves may extend in both horizontal directions. We present a fast, recursive algorithm to exhaustively generate open meandric systems with n crossings. We then illustrate how to modify the algorithm to generate unidirectional open meandric systems (the curves extend only to the right) and nonisomorphic open meandric systems where equivalence is taken under horizontal reflection. Each algorithm can be modified to generate systems with exactly k curves. In the unidirectional case when k = 1, we can apply a minor modification along with some additional optimization steps to yield the first fast and simple algorithm to generate open meanders.