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
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Listing triconnected rooted plane graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
| Hi-index | 0.00 |
A biconnected plane graph G is called internally triconnected if any cut-pair consists of outer vertices and its removal results in only components each of which contains at least one outer vertex In a rooted plane graph, an edge is designated as an outer edge with a specified direction For given positive integers n≥1 and g≥3, let ${\cal G}_3(n,g)$ (resp., ${\cal G}_{\tt int}(n,g)$) denote the class of all triconnected (resp., internally triconnected) rooted plane graphs with exactly n vertices such that the size of each inner face is at most g In this paper, we present an O(1)-time delay algorithm that enumerates all rooted plane graphs in ${\cal G}_{\tt int}(n,g)-{\cal G}_3(n,g)$ in O(n) space.