2010 | OriginalPaper | Buchkapitel
Constant Time Generation of Biconnected Rooted Plane Graphs
verfasst von : Bingbing Zhuang, Hiroshi Nagamochi
Erschienen in: Frontiers in Algorithmics
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.