Efficient generation of plane trees
Information Processing Letters
Efficient Generation of Plane Triangulations without Repetitions
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Efficient generation of triconnected plane triangulations
Computational Geometry: Theory and Applications
Frequent subgraph mining in outerplanar graphs
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
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
Generating internally triconnected rooted plane graphs
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Enumerating rooted graphs with reflectional block structures
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
| Hi-index | 0.00 |
A plane graph is a drawing of a planar graph in the plane such that no two edges cross each other. A rooted plane graph has a designated outer vertex. For given positive integers n 1 and g 3, let G3(n, g) denote the set of all triconnected rooted plane graphs with exactly n vertices such that the size of each inner face is at most g. In this paper, we give an algorithm that enumerates all plane graphs in G3(n, g). The algorithm runs in constant time per each by outputting the difference from the previous output.