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

DOI10.1137/S0895480192234009zbMath0910.05005OpenAlexW2006528273MaRDI QIDQ4388981

No author found.

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

Stirling numbersgrowth function\(k\)-paths\(k\)-ary strings

Mathematics Subject Classification ID

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

Related Items (2)

Counting and computing the Rand and block distances of pairs of set partitions ⋮ Embeddings of \(k\)-connected graphs of pathwidth \(k\)

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