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
Embedding planar graphs on the grid
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Minimum-width grid drawings of plane graphs
Computational Geometry: Theory and Applications
Enumerating Floorplans with n Rooms
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Efficient Generation of Triconnected Plane Triangulations
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Generating All Triangulations of Plane Graphs (Extended Abstract)
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Random Generation and Enumeration of Proper Interval Graphs
WALCOM '09 Proceedings of the 3rd International Workshop 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
On approximating the d-girth of a graph
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
WG'05 Proceedings of the 31st 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
Constant time generation of linear extensions
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Constant time generation of trees with specified diameter
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
On approximating the d-girth of a graph
Discrete Applied Mathematics
| Hi-index | 0.00 |
A "based" plane triangulation is a plane triangulation with one designated edge on the outer face. In this paper we give a simple algorithm to generate all biconnected based plane triangulations with at most n vertices. 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 we can generate all biconnected based plane triangulation having exactly n vertices including exactly r vertices on the outer face in O(1) time per triangulation without duplications, while the previous best algorithm generates such triangulations in O(n2) time per triangulation. Also we can generate without duplications all biconnected (non-based) plane triangulations having exactly n vertices including exactly r vertices on the outer face in O(r2n) time per triangulation, and all maximal planar graphs having exactly n vertices in O(n3) time per graph.