Efficient Algorithms for Listing Combinatorial Structures

DOI10.1017/CBO9780511569913MaRDI QIDQ3069254zbMATH OpenFDO

Authors Leslie Ann Goldberg

Publication date 25 January 2011

Full work available at URL https://doi.org/10.1017/CBO9780511569913

Mathematics Subject Classification ID

Collected or selected works; reprintings or translations of classics (01A75) Enumeration in graph theory (05C30) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Combinatorics in computer science (68R05) Parallel algorithms in computer science (68W10)

Cited in

(3)

• A structure theorem for rooted binary phylogenetic networks and its implications for tree-based networks
• Combinatorial Algorithms for Listing Paths in Minimal Change Order
• A model partitioning method based on dynamic decoupling for the efficient simulation of multibody systems

This page was built for publication: Efficient Algorithms for Listing Combinatorial Structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3069254)