Efficient Algorithms for Listing Combinatorial Structures

DOI10.1017/CBO9780511569913MaRDI QIDQ4282002zbMATH OpenFDO

Authors Leslie Ann Goldberg

Publication date 17 February 1994

zbMATH Keywords

Turing machinecombinatorial structuresfast listing algorithm

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Combinatorics in computer science (68R05) Enumeration in graph theory (05C30) Parallel algorithms in computer science (68W10)

Recommendations

• Efficient algorithms for listing unlabeled graphs
• A loop-free algorithm for generating the linear extensions of a poset
• Listing combinatorial objects in parallel
• Mathematical Foundations of Computer Science 2003
• Isomorph-Free Exhaustive Generation

Cited in

(19)

• A linear time algorithm to list the minimal separators of chordal graphs
• Cataloguing general graphs by point and line spectra
• Listing graphs that satisfy first-order sentences
• Ranking and unranking of non-regular trees with a prescribed branching sequence
• Approximately counting locally-optimal structures
• Efficient enumeration of ordered trees with \(k\) leaves
• Extracting interval temporal logic rules: a first approach
• Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
• Efficient generation of plane trees.
• Combinatorial Algorithms for Listing Paths in Minimal Change Order
• Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
• Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data
• Efficient enumeration of all minimal separators in a graph
• Local multiple alignment via subgraph enumeration
• Listing All Plane Graphs
• Efficient generation of triconnected plane triangulations.
• Comparing performance of algorithms for generating concept lattices
• An optimal algorithm to generate tilings
• Approximately Counting Locally-Optimal Structures

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 Q4282002)