A Fast Algorithm for Generating Nonisomorphic Chord Diagrams

Authors:
Joe Sawada
Affiliations:
-
Venue:
SIAM Journal on Discrete Mathematics
Year:
2002

Citing 0
Cited 3

A fast algorithm to generate necklaces with fixed content

Theoretical Computer Science
Generating rooted and free plane trees

ACM Transactions on Algorithms (TALG)
Combinatorics and Geometry of Finite and Infinite Squaregraphs

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.