Constant time generation of free trees
SIAM Journal on Computing
Efficient algorithms for listing combinatorial structures
Efficient algorithms for listing combinatorial structures
Isomorph-free exhaustive generation
Journal of Algorithms
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Efficient enumeration of all ladder lotteries and its application
Theoretical Computer Science
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Constant time generation of biconnected rooted plane graphs
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Listing triconnected rooted plane graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Listing chordal graphs and interval graphs
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Generating internally triconnected rooted plane graphs
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Efficient enumeration of ordered trees with k leaves
Theoretical Computer Science
| Hi-index | 0.00 |
A "rooted" plane triangulation is a plane triangulation with one designated vertex on the outer face. A simple algorithm to generate all triconnected rooted plane triangulations with at most n vertices is presented. The algorithm uses O(n) space and generates such triangulations in O(1) time per triangulation without duplications. The algorithm does not output entire triangulations but the difference from the previous triangulation. By modifying the algorithm all triconnected rooted plane triangulations having exactly n vertices including exactly r vertices on the outer face in O(r) time per triangulation can be generated without duplicates, while the previous best algorithm generates such triangulations in O(n2) time per triangulation. All triconnected (non-rooted) plane triangulations having exactly n vertices including exactly r vertices on the outer face can also be generated without duplicates in O(r2n) time per triangulation, and all maximal planar graphs can be generated in O(n3) time per graph.