IEICE Transactions on Information and Systems
Online ISSN : 1745-1361
Print ISSN : 0916-8532
Special Section on Foundations of Computer Science — Mathematical Foundations and Applications of Algorithms and Computer Science —
Generation of Symmetric and Asymmetric Biconnected Rooted Outerplanar Graphs
Bingbing ZHUANGHiroshi NAGAMOCHI
Author information
JOURNAL FREE ACCESS

2011 Volume E94.D Issue 2 Pages 211-219

Details
Abstract

In a rooted graph, a vertex is designated as its root. An outerplanar graph is represented by a plane embedding such that all vertices appear along its outer boundary. Two different plane embeddings of a rooted outerplanar graphs are called symmetric copies. Given integers n ≥ 3 and g ≥ 3, we give an O(n)-space and O(1)-time delay algorithm that generates all biconnected rooted outerplanar graphs with exactly n vertices such that the size of each inner face is at most g without delivering two symmetric copies of the same graph.

Content from these authors
© 2011 The Institute of Electronics, Information and Communication Engineers
Previous article Next article
feedback
Top