Efficient enumeration of non-isomorphic interval graphs
2021 ◽
Vol vol. 23 no. 1
(Graph Theory)
◽
Recently, Yamazaki et al. provided an algorithm that enumerates all non-isomorphic interval graphs on $n$ vertices with an $O(n^4)$ time delay. In this paper, we improve their algorithm and achieve $O(n^3 \log n)$ time delay. We also extend the catalog of these graphs providing a list of all non-isomorphic interval graphs for all $n$ up to $15$.
2002 ◽
Vol 132
(01)
◽
pp. 75
1999 ◽
Vol 23
(1)
◽
pp. 185-196
◽
Keyword(s):
2000 ◽
Vol 24
(1)
◽
pp. 135-149
◽
1997 ◽
Vol 21
(1-2)
◽
pp. S367-S371
2007 ◽
Vol 38
(1)
◽
pp. 73-78
◽
1995 ◽
Vol 115
(1)
◽
pp. 167-168