2000 character limit reached
Efficient enumeration of non-isomorphic interval graphs (1906.04094v4)
Published 10 Jun 2019 in math.CO and cs.DM
Abstract: Recently, Yamazaki et al. provided an algorithm that enumerates all non-isomorphic interval graphs on $n$ vertices with an $O(n4)$ time delay. In this paper, we improve their algorithm and achieve $O(n3 \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$.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.