Constant time generation of biconnected rooted plane graphs

Authors:
Bingbing Zhuang;Hiroshi Nagamochi
Affiliations:
Graduate School of Informatics, Kyoto University;Graduate School of Informatics, Kyoto University
Venue:
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Year:
2010

Citing 12
Cited 1

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
The advantages of forward thinking in generating rooted and free trees

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
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
Listing all plane graphs

WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Generating colored trees

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science

Listing triconnected rooted plane graphs

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

A plane graph is a drawing of a planar graph in the plane such that no two edges cross each other. In a rooted plane graph, an outer (directed) edge is designated as the root. For a given positive integer n ≥ 1, we give an O(1)-time delay algorithm that enumerates all plane graphs with exactly n vertices using O(n) space. Our algorithm can generates only plane graphs such that the size of each inner face is bounded from above by a prescribed integer g ≥ 3 in the same time and space complexity.