Efficient Algorithms for Listing Combinatorial Structures
From MaRDI portal
Publication:3069254
DOI10.1017/CBO9780511569913zbMath1205.01051MaRDI QIDQ3069254
Publication date: 25 January 2011
Combinatorics in computer science (68R05) Enumeration in graph theory (05C30) Parallel algorithms in computer science (68W10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Collected or selected works; reprintings or translations of classics (01A75)
Related Items (2)
A model partitioning method based on dynamic decoupling for the efficient simulation of multibody systems ⋮ A Structure Theorem for Rooted Binary Phylogenetic Networks and Its Implications for Tree-Based Networks
This page was built for publication: Efficient Algorithms for Listing Combinatorial Structures
