A fast algorithm for generating nonisomorphic chord diagrams
J Sawada - SIAM Journal on Discrete Mathematics, 2002 - SIAM
SIAM Journal on Discrete Mathematics, 2002•SIAM
Using a new string representation, we develop two algorithms for generating nonisomorphic
chord diagrams. Experimental evidence indicates that the latter of the two algorithms runs in
constant amortized time. In addition, we use simple counting techniques to derive a formula
for the number of nonisomorphic chord diagrams.
chord diagrams. Experimental evidence indicates that the latter of the two algorithms runs in
constant amortized time. In addition, we use simple counting techniques to derive a formula
for the number of nonisomorphic chord diagrams.
Using a new string representation, we develop two algorithms for generating nonisomorphic chord diagrams. Experimental evidence indicates that the latter of the two algorithms runs in constant amortized time. In addition, we use simple counting techniques to derive a formula for the number of nonisomorphic chord diagrams.
Society for Industrial and Applied Mathematics