Algorithms for sequential generation of combinatorial structures

DOI10.1016/0166-218X(92)90269-GzbMath0679.68126MaRDI QIDQ1822996

François Bergeron

Publication date: 1989

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

functional equationscombinatorial algorithmsalgebraic descriptionspecies of structuressequential generation of combinatorial structures

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Enumerative combinatorics (05A99) Data structures (68P05) General topics in the theory of software (68N01)

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

This page was built for publication: Algorithms for sequential generation of combinatorial structures