Analysis of Algorithms for Listing Equivalence Classes of k-ary Strings

DOI10.1137/S0895480192234009MaRDI QIDQ4388981zbMATH OpenOpenAlexFDO

Authors

Publication date 11 May 1998

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

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

zbMATH Keywords

\(k\)-ary strings\(k\)-pathsgrowth functionStirling numbers

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Combinatorics on words (68R15)

Recommendations

• scientific article; zbMATH DE number 1445312
• Generating bracelets in constant amortized time
• Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)
• scientific article; zbMATH DE number 1305469

Cited in

(3)

• Embeddings of \(k\)-connected graphs of pathwidth \(k\)
• Counting and computing the Rand and block distances of pairs of set partitions
• An analysis of the Karp-Rabin string matching algorithm

This page was built for publication: Analysis of Algorithms for Listing Equivalence Classes of k-ary Strings

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