A fast algorithm for generating nonisomorphic chord diagrams

SIAM Journal on Discrete Mathematics

Volumn 15, Issue 4, 2002, Pages 546-561

  Sawada, Joe ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Chord diagram; Enumeration; Generation algorithm; Necklace

Indexed keywords

ALGORITHMS; INVARIANCE; MATHEMATICAL MODELS; PROBLEM SOLVING;

CHORD DIAGRAMS;

SET THEORY;

EID: 0036662502     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480100377970     Document Type: Article

References (15)

1. D. Bar-Natan, On the Vassiliev knot invariants, Topology, 34 (1995), pp. 423-472.
2. J. Birman And R. Trapp, Braided chord diagrams, J. Knot Theory Ramifications, 7 (1998), pp. 1-22.
3. K. Cattell, F. Ruskey, J. Sawada, C.R. Miers, And M. Serra, Fast algorithms to generate necklaces, unlabeled necklaces, and irreducible polynomials over GF(2), J. Algorithms, 37 (2000), pp. 267-282.
4. R. Cori And M. Marcus, Counting non-isomorphic chord diagrams, Theoret. Comput. Sci., 204 (1998), pp. 55-73.
5. J.-P. Duval, Factoring words over an ordered alphabet, J. Algorithms, 4 (1983), pp. 363-381.
6. J. Harer And D. Zagier, The Euler characteristic of the moduli space of curves, Invent. Math., 85 (1986), pp. 457-485.
7. J.E. Koehler, Folding a strip of stamps, J. Combinatorial Theory, 5 (1968), pp. 135-152.
8. B. Li And H. Sun, Exact number of chord diagrams and an estimation of the number of spine diagrams of order n, Chinese Sci. Bull., 42 (1997), pp. 705-720.
9. F. Ruskey And J. Sawada, An efficient algorithm for generating necklaces of fixed density, SIAM J. Comput., 29 (1999), pp. 671-684.
10. J. Sawada, Fast Algorithms to Generate Restricted Classes of Strings under Rotation, Dissertation, University of Victoria, Victoria, BC, Canada, 2000.
11. J. Sawada, Generating bracelets in constant amortized time, SIAM J. Comput., 31 (2001), pp. 259-268.
12. A. Stoimenow, Enumeration of chord diagrams and an upper bound for Vassiliev invariants, J. Knot Theory Ramifications, 7 (1998), pp. 93-114.
13. A. Stoimenow, On the number of chord diagrams, Discrete Math., 218 (2000), pp. 209-233.
14. T. Walsh And A. Lehman, Counting rooted maps by genus I, J. Combinatorial Theory Ser. B, 13 (1972), pp. 192-218.
15. T. Walsh And A. Lehman, Counting rooted maps by genus II, J. Combinatorial Theory Ser. B, 13 (1972), pp. 122-141.