Listing All st-Orientations

Andry SETIAWAN  Shin-ichi NAKANO  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E94-A   No.10   pp.1965-1970
Publication Date: 2011/10/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E94.A.1965
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Algorithms and Data Structures
graph,  st-orientation,  enumeration,  

Full Text: PDF(624.8KB)>>
Buy this Article

In this paper we give a simple algorithm to generate all st-orientations of a given biconnected plane graph G with a designated edge (s,t) on the outer face of G. Our algorithm generates all st-orientations of G in O(n) time for each without duplications, where n is the number of vertices.