Abstract
We investigate connected proper interval graphs without vertex labels. We first give the number of connected proper interval graphs of n vertices. Using it, a simple algorithm that generates a connected proper interval graph uniformly at random up to isomorphism is presented. Finally an enumeration algorithm of connected proper interval graphs is proposed. The algorithm is based on the reverse search, and it outputs each connected proper interval graph in O(1) time. © Springer-Verlag Berlin Heidelberg 2009.
Author supplied keywords
Cite
CITATION STYLE
Saitoh, T., Yamanaka, K., Kiyomi, M., & Uehara, R. (2009). Random generation and enumeration of proper interval graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5431 LNCS, pp. 177–189). https://doi.org/10.1007/978-3-642-00202-1_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
