Algorithms for sequential generation of combinatorial structures
From MaRDI portal
Publication:1822996
DOI10.1016/0166-218X(92)90269-GzbMath0679.68126MaRDI QIDQ1822996
Publication date: 1989
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
functional equations; combinatorial algorithms; algebraic description; species of structures; sequential generation of combinatorial structures
68R10: Graph theory (including graph drawing) in computer science
05A99: Enumerative combinatorics
68P05: Data structures
68N01: General topics in the theory of software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Une approche combinatoire pour l'itération de Newton-Raphson
- Une combinatoire sous-jacente au théorème des fonctions implicites. (Combinatorics underlying the implicit functions theorem)
- Une théorie combinatoire des séries formelles
- A method and two algorithms on the theory of partitions
- On the analysis of algorithms for trees
- On random 2-3 trees
- A unifying look at data structures
- Fast Algorithms for Manipulating Formal Power Series