A Fast Algorithm for Generating Nonisomorphic Chord Diagrams

DOI10.1137/S0895480100377970zbMath1006.05006OpenAlexW2011322133MaRDI QIDQ4785701

Joe Sawada

Publication date: 5 January 2003

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480100377970

zbMATH Keywords

enumerationchord diagramnecklacegeneration algorithm

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics in computer science (68R05) Combinatorics on words (68R15)

Related Items

Non-P-recursiveness of numbers of matchings or linear chord diagrams with many crossings ⋮ A fast algorithm to generate necklaces with fixed content