Sciweavers

Share
ISAAC
2009
Springer

Random Generation and Enumeration of Bipartite Permutation Graphs

12 years 6 months ago
Random Generation and Enumeration of Bipartite Permutation Graphs
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite permutation graphs of n vertices is given. Based on the number, a simple algorithm that generates a connected bipartite permutation graph uniformly at random up to isomorphism is presented. Finally an enumeration algorithm of connected bipartite permutation graphs is proposed. The algorithm is based on the reverse search, and it outputs each connected bipartite permutation graph in O(1) time.
Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, R
Added 26 May 2010
Updated 26 May 2010
Type Conference
Year 2009
Where ISAAC
Authors Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara
Comments (0)
books