2010 | OriginalPaper | Buchkapitel
Listing Triconnected Rooted Plane Graphs
verfasst von : Bingbing Zhuang, Hiroshi Nagamochi
Erschienen in: Combinatorial Optimization and Applications
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. A rooted plane graph has a designated outer vertex. For given positive integers
n
≥ 1 and
g
≥ 3, let
${\cal G}_3(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
${\cal G}_3(n,g)$
. The algorithm runs in constant time per each by outputting the difference from the previous output.