Efficient enumeration of non-isomorphic interval graphs
Combinatorics
2023-06-22 v4 Discrete Mathematics
Abstract
Recently, Yamazaki et al. provided an algorithm that enumerates all non-isomorphic interval graphs on vertices with an time delay. In this paper, we improve their algorithm and achieve time delay. We also extend the catalog of these graphs providing a list of all non-isomorphic interval graphs for all up to .
Cite
@article{arxiv.1906.04094,
title = {Efficient enumeration of non-isomorphic interval graphs},
author = {Patryk Mikos},
journal= {arXiv preprint arXiv:1906.04094},
year = {2023}
}