Random generation and enumeration of proper interval graphs
IEICE TRANSACTIONS on Information and Systems, 2010•search.ieice.org
We investigate connected proper interval graphs without vertex labels. We first give the
number of connected proper interval graphs of n vertices. Using this result, 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 reverse search, and it outputs each
connected proper interval graph in (O) 1 time.
number of connected proper interval graphs of n vertices. Using this result, 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 reverse search, and it outputs each
connected proper interval graph in (O) 1 time.
We investigate connected proper interval graphs without vertex labels. We first give the number of connected proper interval graphs of n vertices. Using this result, 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 reverse search, and it outputs each connected proper interval graph in (O)1 time.
search.ieice.org
Showing the best result for this search. See all results