Efficient Algorithms for Listing Combinatorial Structures
From MaRDI portal
Publication:4282002
DOI10.1017/CBO9780511569913zbMath0821.68059MaRDI QIDQ4282002
Publication date: 17 February 1994
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)
Related Items (18)
A linear time algorithm to list the minimal separators of chordal graphs ⋮ Listing graphs that satisfy first-order sentences ⋮ Approximately counting locally-optimal structures ⋮ Approximately Counting Locally-Optimal Structures ⋮ Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph ⋮ Cataloguing general graphs by point and line spectra ⋮ Efficient enumeration of all minimal separators in a graph ⋮ Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data ⋮ Efficient enumeration of ordered trees with \(k\) leaves ⋮ Efficient generation of triconnected plane triangulations. ⋮ Listing All Plane Graphs ⋮ An optimal algorithm to generate tilings ⋮ Ranking and unranking of non-regular trees with a prescribed branching sequence ⋮ Unnamed Item ⋮ Comparing performance of algorithms for generating concept lattices ⋮ Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) ⋮ Local multiple alignment via subgraph enumeration ⋮ Efficient generation of plane trees.
This page was built for publication: Efficient Algorithms for Listing Combinatorial Structures
