Abstract
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 time. © 2009 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Saitoh, T., Otachi, Y., Yamanaka, K., & Uehara, R. (2009). Random generation and enumeration of bipartite permutation graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5878 LNCS, pp. 1104–1113). https://doi.org/10.1007/978-3-642-10631-6_111
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
