A Fast Algorithm for Generating Nonisomorphic Chord Diagrams

DOI10.1137/S0895480100377970MaRDI QIDQ4785701zbMATH OpenOpenAlexFDO

Authors 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

necklaceenumerationchord diagramgeneration algorithm

Mathematics Subject Classification ID

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

Recommendations

• Counting non-isomorphic chord diagrams
• Genus ranges of chord diagrams
• Generating bracelets with fixed content
• Fast generation of cubic graphs
• On the number of chord diagrams

Cited in

(3)

• A fast algorithm to generate necklaces with fixed content
• Non-P-recursiveness of numbers of matchings or linear chord diagrams with many crossings
• On the uniform generation of modular diagrams

This page was built for publication: A Fast Algorithm for Generating Nonisomorphic Chord Diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785701)