Computer Algebra Libraries for Combinatorial Structures

This paper introduces the framework of decomposable combinatorial structures and their traversal algorithms. A combinatorial type is decomposable if it admits a specification in terms of unions, products, sequences, sets, and cycles, either in the labelled or in the unlabelled context. Many properti...

Full description

Bibliographic Details

Published in:	Journal of symbolic computation Vol. 20; no. 5; pp. 653 - 671
Main Authors:	Flajolet, Philippe, Salvy, Bruno
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.11.1995
ISSN:	0747-7171, 1095-855X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!