Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have